Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization

Eva Vallada () and Rubén Ruiz ()
Additional contact information
Eva Vallada: Universidad Politécnica de Valencia
Rubén Ruiz: Universidad Politécnica de Valencia

Chapter Chapter 4 in Just-in-Time Systems, 2012, pp 67-90 from Springer

Abstract: Abstract This work deals with the unrelated parallel machine scheduling problem with machine and job-sequence dependent setup times. The studied objective is the minimization of the total weighted earliness and tardiness. We study existing Mixed Integer Programming (MIP) mathematical formulations. A genetic algorithm is proposed, which includes a procedure for inserting idle times in the production sequence in order to improve the objective value. We also present a benchmark of small and large instances to carry out the computational experiments. After an exhaustive computational and statistical analysis, the conclusion is that the proposed method shows a good performance.

Keywords: Completion Time; Setup Time; Parallel Machine; Idle Time; Relative Percentage Deviation (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (4)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4614-1123-9_4

Ordering information: This item can be ordered from
http://www.springer.com/9781461411239

DOI: 10.1007/978-1-4614-1123-9_4

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().