Scheduling unrelated parallel machines with sequence-dependent setups

Logendran, Rasaratnam; McDonell, Brent; Smucker, Byran J.

doi:10.1016/j.cor.2006.02.006

Cited by 106 publications

(41 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The four combination levels will be compared using the average nadir distance based on 2,000 solutions for each replication. The experimental results indicate that (restart, PR) = (15, 5) and (10,10) yield approximately the same average www.ijarai.thesai.org nadir distance. Thus, policy (15,5) is selected for our GRASP in solving the MET-UPSMP.…”

Section: ) Path-relinkingmentioning

confidence: 66%

See 1 more Smart Citation

Hybrid Metaheuristics for the Unrelated Parallel Machine Scheduling to Minimize Makespan and Maximum Just-in-Time Deviations

Chyu¹,

Chang²

2012

IJARAI

View full text Add to dashboard Cite

Abstract-This paper studies the unrelated parallel machine scheduling problem with three minimization objectivesmakespan, maximum earliness, and maximum tardiness (MET-UPMSP). The last two objectives combined are related to just-intime (JIT) performance of a solution. Three hybrid algorithms are presented to solve the MET-UPMSP: reactive GRASP with path relinking, dual-archived memetic algorithm (DAMA), and SPEA2. In order to improve the solution quality, min-max matching is included in the decoding scheme for each algorithm. An experiment is conducted to evaluate the performance of the three algorithms, using 100 (jobs) x 3 (machines) and 200 x 5 problem instances with three combinations of two due date factors -tight and range. The numerical results indicate that DAMA performs best and GRASP performs second for most problem instances in three performance metrics: HVR, GD, and Spread. The experimental results also show that incorporating min-max matching into decoding scheme significantly improves the solution quality for the two population-based algorithms. It is worth noting that the solutions produced by DAMA with matching decoding can be used as benchmark to evaluate the performance of other algorithms.

show abstract

Section: ) Path-relinkingmentioning

confidence: 66%

“…For a survey of parallel machine scheduling on various objectives and solution methods, we refer to Logendran et al [10] and Allahverdi et al [11]. In contrast, there are relatively few studies on UPMSPs considering multiple objectives.…”

Section: Introductionmentioning

confidence: 99%

Hybrid Metaheuristics for the Unrelated Parallel Machine Scheduling to Minimize Makespan and Maximum Just-in-Time Deviations

Chyu¹,

Chang²

2012

IJARAI

View full text Add to dashboard Cite

show abstract

“…In addition to the eleven constraints in MTA, we introduce (12) in the formulation of MTR to ensure that the completion time of the first job on each machine is equal to its processing time. 1, 2,..., .…”

Section: Mathematical Formulationsmentioning

confidence: 99%

“…Authors considered the use of heuristic for problems of continuous [10] and discrete-variable [11]. Then, UPMSP is discrete-variable problem, and then [12] developed the heuristic with dispatching rules to solve the same problem with sequence-dependent setups time given the weighted tardiness minimization, and [13] developed and solved, too.…”

Section: Introductionmentioning

confidence: 99%

A Mixed Integer Linear Programming Solution for Insertion of Idle Time in the Jobs Scheduling

Tsai¹,

Wang²

2014

Proceedings of the 2nd International Conference on Soft Computing in Information Communication Technology

View full text Add to dashboard Cite

show abstract

“…It has been used to solve many combinatorial problems. SA is a technique of searching for good solutions in a configuration space which draws an analogy between minimum cost configuration in a combinatorial optimization problem (Metropolis et al (1953); Kirkpatrick et al (1983) Liao and Lin (2003); Lee, Wu and Chen(2006); Logendran et al (2007), and Kimet et al, (2006)). …”

Section: Simulated Annealing Algorithmmentioning

confidence: 99%