Dominance rules for single machine schedule with sequence dependent setup and due date
From MaRDI portal
Publication:5408963
DOI10.1007/S11768-005-0025-2zbMATH Open1284.90028OpenAlexW2009533176MaRDI QIDQ5408963FDOQ5408963
Authors:
Publication date: 11 April 2014
Published in: Journal of Control Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11768-005-0025-2
Recommendations
- Single-machine scheduling against due dates with past-sequence-dependent setup times
- Some dominance properties for single-machine tardiness problems with sequence-dependent setup
- Single machine scheduling and due date assignment with positionally dependent processing times
- On single machine scheduling and due dateassignment with positionally dependent processing times
- Single-machine scheduling with waiting-time-dependent due dates
- Single-machine scheduling problems with past-sequence-dependent setup times
- New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives
- Optimal due-date assignment and sequencing in a single machine shop
- Dominance and Decomposition Heuristics for Single Machine Scheduling
- Algorithms for common due-date assignment and sequencing on a single machine with sequence-dependent setup times
Cites Work
Cited In (4)
- Un nouveau concept de dominance pour l'ordonnancement de travaux sur une machine
- Some dominance properties for single-machine tardiness problems with sequence-dependent setup
- A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness
- A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness
This page was built for publication: Dominance rules for single machine schedule with sequence dependent setup and due date
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408963)