No-wait flexible flow shop scheduling with due windows

DOI10.1155/2015/456719zbMath1394.90277OpenAlexW1539307054WikidataQ59118625 ScholiaQ59118625MaRDI QIDQ1665716

Chang-Lin Yang, Rong-Hwa Huang, Shang-Chia Liu

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/456719

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A survey of scheduling problems with no-wait in process

Cites Work

• A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
• A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
• Approximative procedures for no-wait job shop scheduling.
• The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
• A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups
• A new heuristic and dominance relations for no-wait flowshops with setups
• Parallel machine scheduling with a common due window

This page was built for publication: No-wait flexible flow shop scheduling with due windows