Algorithms for the single machine total weighted completion time scheduling problem with release times and sequence-dependent setups

Chou, Fuh-Der; Wang, Huimei; Chang, Tzu-Yun

doi:10.1007/s00170-008-1762-4

Cited by 21 publications

(5 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Considering only the release date of jobs, several authors (e.g. Bianco and Ricciardelli (1982), Hariri and Potts (1983), Belouadah et al (1992), and Chou, Wang, and Chang (2009)) have examined the problem of minimising the total weighted completion time on a single machine.…”

Section: International Journal Of Production Research 3655mentioning

confidence: 99%

Continuous-time algorithms for scheduling a single machine with sequence-dependent setup times and time window constraints in coordinated chains

Jula

Kones

2013

International Journal of Production Research

View full text Add to dashboard Cite

In this paper we address the problem of selecting and scheduling several jobs on a single machine with sequence-dependent setup times and strictly enforced time window constraints on the start time of each job. We use short-term production targets to coordinate decentralised local schedulers and to make the objectives of specific areas in line with the chain objectives by maintaining a desired work in process profile in manufacturing environments. The existing literature in this domain is based on discrete-time approaches. We depart from prior approaches by considering continuous time. We introduce a two-step mathematical programming model based on disjunctive constraints to solve small problems to optimality, and propose an insertion-based heuristic to solve large-scale instances. We provide several variations of the insertion heuristic based on different score functions. The primary objective of these approaches is to maximise the total defined score for jobs while satisfying production targets for families of jobs in each shift. Further, our models minimise the maximum completion time of all selected jobs. The effectiveness, efficiency, and robustness of the proposed algorithms are analysed and compared with the existing literature.

show abstract

Section: International Journal Of Production Research 3655mentioning

confidence: 99%

Continuous-time algorithms for scheduling a single machine with sequence-dependent setup times and time window constraints in coordinated chains

Jula

Kones

2013

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…Unavailability of machines was considered in this article, and the time to begin preventive maintenance is specified and fixed. Chou et al (2009) investigated a deterministic single-machine problem considering sequence-dependent setup time and release time and the purpose was to minimize total weighted completion time. Small-size problems were solved via constraint programming and branch and bound methods, and the big size ones were solved through metaheuristic algorithm.…”

Section: Single-machine Scheduling Problemmentioning

confidence: 99%

Multi-objective optimization of stochastic failure-prone manufacturing system with consideration of energy consumption and job sequences

Amelian

Sajadi

Mehrdad

et al. 2018

Int. J. Environ. Sci. Technol.

View full text Add to dashboard Cite

In this paper, multi-objective optimization of energy-aware multi-product failure-prone manufacturing system is explored. The purpose is to determine the best sequence of jobs, optimal production rate and optimum preventive maintenance time for simultaneous optimization of three criterions of total weighted quadratic earliness and tardiness, system reliability and energy-consumption cost. Considering the uncertainties of the problem such as stochastically machine breakdown and maintenance, stochastic processing times as well as NP-hard nature of the problem, it is not possible to propose an analytical solution to this problem. Therefore, two novel algorithms by combining (1) simulation and NSGA-II/PSO and (2) simulation and NSGA-II/GA are proposed for solving this problem. A set of Pareto optimal solutions was obtained via this algorithm. Results show that the both methods converge to a same optimal solution, but the rate of convergence with NSGA-II/PSO is faster than NSGA-II/GA. The algorithms are evaluated by solving small-, medium-and large-scale problems. To the best of our knowledge, multi-product failure-prone manufacturing systems by considering sequence of jobs have not been explored in any paper and for the first time a new hedging point policy is presented for the mentioned problem.

show abstract

“…Many authors (e.g., Bianco and Ricciardelli [6], Hariri and Potts [11], Belouadah et al [5], and Chou et al [8]) have examined the problem of minimizing the total weighted completion time with job release date on a single machine. Kedad-Sidhoum and Sourd's [15] article is among several articles that address one machine scheduling problem with penalties on earliness and tardiness of jobs.…”

Section: Related Literaturementioning

confidence: 99%

Scheduling a single machine to maintain a dynamic WIP profile in coordinated manufacturing chains

Jula

Kones

2011

Int J Adv Manuf Technol

View full text Add to dashboard Cite

This article addresses the problem of selecting and scheduling several jobs on a single machine to sustain the desired dynamic work-in-process profile. We consider sequence-dependent setup times between jobs and strictly enforced time window constraints on the start time of each job. We use working shift production targets to coordinate decentralized local schedulers and make them inline with the manufacturing chain goals. Based on the discretization of scheduling time horizon, we propose a two-step mixed-integer programming model and a new network-based heuristic. The primary objective of these approaches is to maximize the total defined score for jobs while satisfying production targets. The secondary objective is to minimize the maximum completion time of all selected jobs. The effectiveness, efficiency, and robustness of the proposed algorithms are analyzed and compared with two existing approaches over a wide range of simulated scenarios.

show abstract

Algorithms for the single machine total weighted completion time scheduling problem with release times and sequence-dependent setups

Cited by 21 publications

References 19 publications

Continuous-time algorithms for scheduling a single machine with sequence-dependent setup times and time window constraints in coordinated chains

Continuous-time algorithms for scheduling a single machine with sequence-dependent setup times and time window constraints in coordinated chains

Multi-objective optimization of stochastic failure-prone manufacturing system with consideration of energy consumption and job sequences

Scheduling a single machine to maintain a dynamic WIP profile in coordinated manufacturing chains

Contact Info

Product

Resources

About