The development of more efficient and better performing priority dispatching rules (PDRs) for production scheduling is relevant to modern flow shop scheduling practice because they are simple, easy to apply and have low computational complexity, especially for large-scale problems. While the current research trend in scheduling is towards finding superior solutions through meta-heuristics, they are computationally expensive and many meta-heuristics also use PDRs to generate starting points. In this paper, we analyse the properties of flow shop scheduling problems to minimise maximum completion time, and generate a new dominance rule that is complementary to Szwarc’s rule. These dominance rules indicate that a weighting factor should be included in sequencing to account for the possibility that a single job’s processing time can generate idle time repeatedly within a flow line. Two new PDRs with a leveraged weighting factor are proposed to minimise makespan and average completion time. Computational results on Taillard’s benchmark problems and on historical operating room data show that the proposed PDRs perform much better than established PDRs without an increase in computational complexity.
|Number of pages||16|
|Journal||International Journal of Production Research|
|State||Published - Jun 3 2017|
Bibliographical notePublisher Copyright:
© 2016 Informa UK Limited, trading as Taylor & Francis Group.
- dispatching rules
- dominance rules
- flow shop
ASJC Scopus subject areas
- Strategy and Management
- Management Science and Operations Research
- Industrial and Manufacturing Engineering