Efficient algorithms for flexible job shop scheduling with parallel machines

Wieslaw Kubiak, Yanling Feng, Guo Li, Suresh Sethi and Chelliah Sriskandarajah

Naval Research Logistics (NRL), 2020, vol. 67, issue 4, 272-288

Abstract: Job shop scheduling with a bank of machines in parallel is important from both theoretical and practical points of view. Herein we focus on the scheduling problem of minimizing the makespan in a flexible two‐center job shop. The first center consists of one machine and the second has k parallel machines. An easy‐to‐perform approximate algorithm for minimizing the makespan with one‐unit‐time operations in the first center and k‐unit‐time operations in the second center is proposed. The algorithm has the absolute worst‐case error bound of k − 1, and thus for k = 1 it is optimal. Importantly, it runs in linear time and its error bound is independent of the number of jobs to be processed. Moreover, the algorithm can be modified to give an optimal schedule for k = 2.

Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://doi.org/10.1002/nav.21901

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:wly:navres:v:67:y:2020:i:4:p:272-288

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().