Exact and metaheuristic approaches for identical parallel machine scheduling with a common server and sequence-dependent setup times

João Marcos Pereira Silva, Ewerton Teixeira and Anand Subramanian

Journal of the Operational Research Society, 2021, vol. 72, issue 2, 444-457

Abstract: We consider the problem of scheduling parallel machines with a common server and sequence-dependent setup times, whose objective is to minimize the makespan. In this case, the common server, which can be a machine, individual or a team, is responsible for performing the setup operations. Therefore, there must be no conflicts while conducting them. An arc-time-indexed formulation is proposed for the problem, as well as an algorithm based on the metaheuristic iterated local search that makes use of an improved decoding algorithm. Computational experiments were carried out on 150 instances involving up to 100 jobs ranging from 2 to 10 machines. The results obtained suggest that the methods developed were capable of finding highly competitive solutions when compared to those achieved by existing approaches.

Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2019.1671153 (text/html)
Access to full text is restricted to subscribers.

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:taf:tjorxx:v:72:y:2021:i:2:p:444-457

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2019.1671153

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().