Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective

doi:10.1016/S0736-5845(02)00077-7

Home
/
Papers
/
Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective

Journal Article•DOI•

Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective

Dong Won Kim¹, Dong Gil Na¹, F. Frank Chen²•Institutions (2)

Chonbuk National University¹, Virginia Tech²

01 Feb 2003-Robotics and Computer-integrated Manufacturing (Pergamon)-Vol. 19, Iss: 1, pp 173-181

TL;DR: Four search heuristics are proposed to address the problem, namely the earliest weighted due date, the shortest weighted processing time, the two-level batch scheduling heuristic, and the simulated annealing method.

read less

Abstract: This paper presents several search heuristics and their performance in batch scheduling of parallel, unrelated machines. Identical or similar jobs are typically processed in batches in order to decrease setup times and/or processing times. The problem accounts for allotting batched work parts into unrelated parallel machines, where each batch consists of a fixed number of jobs. Some batches may contain different jobs but all jobs within each batch should have an identical processing time and a common due date. Processing time of each job of a batch is determined according to the machine group as well as the batch group to which the job belongs. Major or minor setup times are required between two subsequent batches depending on batch sequence but are independent of machines. The objective of our study is to minimize the total weighted tardiness for the unrelated parallel machine scheduling. Four search heuristics are proposed to address the problem, namely (1) the earliest weighted due date, (2) the shortest weighted processing time, (3) the two-level batch scheduling heuristic, and (4) the simulated annealing method. These proposed local search heuristics are tested through computational experiments with data from dicing operations of a compound semiconductor manufacturing facility.

...read moreread less

Citations

PDF

Open Access

More filters

Journal Article•DOI•

A survey of scheduling problems with setup times or costs

[...]

Ali Allahverdi¹, Chi To Ng², T.C.E. Cheng², Mikhail Y. Kovalyov³•Institutions (3)

Kuwait University¹, Hong Kong Polytechnic University², National Academy of Sciences of Belarus³

16 Jun 2008-European Journal of Operational Research

TL;DR: An extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers is provided, which classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times.

...read moreread less

1,264 citations

Additional excerpts

...A comparison of the genetic algorithm presented by Tamimi and Rajan (1997) and the hybrid heuristic proposed by Kim et al. (2003b) remains to be performed....
[...]
...=P wjT j was studied by Kim et al. (2003a)....
[...]
...…et al. (2002) P T j (R, jobs in a family have the same due date) Simulated annealing Chen and Powell (2003) P wjCj, P wjUj Branch-and-bound algorithm Kim et al. (2003a) P wjT j (R, multioperational jobs, operations of the same job can be processed concurrently) Constructive heuristics and…...
[...]
...Kim et al. (2003b) presented a heuristic for the same problem, which consists of four phases, where the third phase is a tabu search....
[...]

Journal Article•DOI•

A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times

[...]

Eva Vallada¹, Rubén Ruiz¹•Institutions (1)

Polytechnic University of Valencia¹

16 Jun 2011-European Journal of Operational Research

TL;DR: After an exhaustive computational and statistical analysis it can be concluded that the proposed method shows an excellent performance overcoming the rest of the evaluated methods in a comprehensive benchmark set of instances.

...read moreread less

335 citations

Cites background from "Unrelated parallel machine scheduli..."

...In Kim et al. (2003) and Kim and Shin (2003) a heuristic and tabu search algorithm were proposed with the objective to minimise the total weighted tardiness and the maximum lateness, respectively....
[...]

Journal Article•DOI•

Heuristics for the Unrelated Parallel Machine Scheduling Problem with Setup Times

[...]

Ghaith Rabadi¹, Reinaldo J. Moraga², Ameer Al-Salem³•Institutions (3)

Old Dominion University¹, University of the Bío Bío², Qatar University³

01 Feb 2006-Journal of Intelligent Manufacturing

TL;DR: The results show that Meta-RaPS found all optimal solutions for the small problems and outperformed the solutions obtained by the existing heuristic for larger problems.

...read moreread less

Abstract: The problem addressed in this paper is the non-preemptive unrelated parallel machine scheduling problem with the objective of minimizing the makespan. Machine-dependent and job sequence-dependent setup times are considered, all jobs are available at time zero, and all times are deterministic. This is a NP-hard problem and in this paper, optimal solutions are found for small problems only. For larger problems, a new meta-heuristic, Meta-RaPS, is introduced and its performance is evaluated by comparing its solutions to the solutions of an existing heuristic for the same problem. The results show that Meta-RaPS found all optimal solutions for the small problems and outperformed the solutions obtained by the existing heuristic for larger problems.

...read moreread less

166 citations

Cites methods from "Unrelated parallel machine scheduli..."

...Some authors have considered the use of metaheuristic approaches for the unrelated PMSP. Kim et al. (2002, 2003) developed heuristics for the problem including a Simulated Annealing (SA) to minimize the total tardiness with machine-independent sequence-dependent setup times....
[...]
...Kim et al. (2002, 2003) developed heuristics for the problem including a Simulated Annealing (SA) to minimize the total tardiness with machine-independent sequence-dependent setup times....
[...]

Journal Article•DOI•

A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times

[...]

Jean-Paul Arnaout¹, Ghaith Rabadi², Rami Musa•Institutions (2)

Lebanese American University¹, Old Dominion University²

01 Dec 2010-Journal of Intelligent Manufacturing

TL;DR: An Ant Colony Optimization algorithm is introduced and is applied to this NP-hard problem with machine-dependent and sequence-dependent setup times and the results show that ACO outperformed the other algorithms.

...read moreread less

Abstract: This paper addresses the non-preemptive unrelated parallel machine scheduling problem with machine-dependent and sequence-dependent setup times. All jobs are available at time zero, all times are deterministic, and the objective is to minimize the makespan. An Ant Colony Optimization (ACO) algorithm is introduced in this paper and is applied to this NP-hard problem; in particular, the proposed ACO tackles a special structure of the problem, where the ratio of the number of jobs to the number of machines is large (i.e., for a highly utilized set of machines). Its performance is evaluated by comparing its solutions to solutions obtained using Tabu Search and other existing heuristics for the same problem, namely the Partitioning Heuristic and Meta-RaPS. The results show that ACO outperformed the other algorithms.

...read moreread less

137 citations

Cites methods from "Unrelated parallel machine scheduli..."

...Some authors have considered the use of metaheuristic approaches for the unrelated PMSP. Kim et al. (2002, 2003) developed heuristics for the problem including a Simulated Annealing (SA) to minimize the total tardiness with machineindependent sequence-dependent setup times....
[...]

Journal Article•DOI•

[...]

Rasaratnam Logendran¹, Brent McDonell¹, Byran J. Smucker¹•Institutions (1)

Oregon State University¹

01 Nov 2007-Computers & Operations Research

TL;DR: A methodology for minimizing the weighted tardiness of jobs in unrelated parallel machining scheduling with sequence-dependent setups is presented and the use of a specific search algorithm led to identifying solutions of better quality or that required lower computation time, but not both.

...read moreread less

118 citations

Cites background or methods from "Unrelated parallel machine scheduli..."

...From Table 13, the model for CT is significant for medium size problems, and so is the contribution due to the TS algorithm, but not the IS or the interaction between them....
[...]
...Keywords: Unrelated parallel machine scheduling; Sequence-dependent setups; Tabu search...
[...]

1
2
3
4
…
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25

Collapse

References

PDF

Open Access

More filters

Journal Article•DOI•

Optimization by Simulated Annealing

[...]

Scott Kirkpatrick¹, C. D. Gelatt¹, Mario P. Vecchi²•Institutions (2)

IBM¹, Venezuelan Institute for Scientific Research²

13 May 1983-Science

TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.

...read moreread less

Abstract: There is a deep and useful connection between statistical mechanics (the behavior of systems with many degrees of freedom in thermal equilibrium at a finite temperature) and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters). A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems. This connection to statistical mechanics exposes new information and provides an unfamiliar perspective on traditional optimization problems and methods.

...read moreread less

41,772 citations

Journal Article•DOI•

Scheduling with batching: A review

[...]

Chris N. Potts¹, Mikhail Y. Kovalyov²•Institutions (2)

University of Southampton¹, National Academy of Sciences of Belarus²

16 Jan 2000-European Journal of Operational Research

TL;DR: This paper reviews the literature on scheduling with batching, giving details of the basic algorithms, and referencing other significant results about efficient dynamic programming algorithms for solving batching problems.

...read moreread less

904 citations

Journal Article•DOI•

A state-of-the-art review of parallel-machine scheduling research

[...]

T.C.E. Cheng¹, C.C.S. Sin²•Institutions (2)

University of Manitoba¹, University of Waterloo²

15 Aug 1990-European Journal of Operational Research

TL;DR: The major research results in deterministic parallel-machine scheduling theory will pass a survey and it is revealed that there exist a lot of potential areas worthy of further research.

...read moreread less

499 citations

Journal Article•DOI•

A decomposition algorithm for the single machine total tardiness problem

[...]

Chris N. Potts¹, L Van Wassenhove²•Institutions (2)

Keele University¹, Katholieke Universiteit Leuven²

01 Nov 1982-Operations Research Letters

TL;DR: The problem of sequencing jobs on a single machine to minimize total tardiness is considered and an algorithm, which decomposes the problem into subproblems which are then solved by dynamic programming when they are sufficiently small.

...read moreread less

306 citations

Journal Article•DOI•

[...]

Dong Won Kim¹, Kyong Kim¹, Wooseung Jang², F. Frank Chen³•Institutions (3)

Chonbuk National University¹, University of Missouri², Virginia Tech³

01 Jun 2002-Robotics and Computer-integrated Manufacturing

TL;DR: Simulated annealing (SA), a meta-heuristic, is employed in this study to determine a scheduling policy so as to minimize total tardiness, and shows that the proposed SA method significantly outperforms a neighborhood search method in terms of total tardyness.

...read moreread less

Abstract: This paper presents a scheduling problem for unrelated parallel machines with sequence-dependent setup times, using simulated annealing (SA). The problem accounts for allotting work parts of L jobs into M parallel unrelated machines, where a job refers to a lot composed of N items. Some jobs may have different items while every item within each job has an identical processing time with a common due date. Each machine has its own processing times according to the characteristics of the machine as well as job types. Setup times are machine independent but job sequence dependent. SA, a meta-heuristic, is employed in this study to determine a scheduling policy so as to minimize total tardiness. The suggested SA method utilizes six job or item rearranging techniques to generate neighborhood solutions. The experimental analysis shows that the proposed SA method significantly outperforms a neighborhood search method in terms of total tardiness.

...read moreread less

233 citations