The proportionate flow shop total tardiness problem
From MaRDI portal
Publication:2178064
DOI10.1016/j.ejor.2020.01.002zbMath1441.90063OpenAlexW2999254741WikidataQ126384866 ScholiaQ126384866MaRDI QIDQ2178064
Publication date: 7 May 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.01.002
Related Items (3)
Improved algorithms for proportionate flow shop scheduling with due-window assignment ⋮ Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- The just-in-time scheduling problem in a flow-shop scheduling system
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
- A note: minimizing maximum earliness on a proportionate flowshop
- Minimizing total weighted completion time in a proportionate flow shop
- A decomposition algorithm for the single machine total tardiness problem
- A fully polynomial approximation scheme for the total tardiness problem
- On decomposition of the total tardiness problem
- On J -maximal and J -minimal Flow-Shop Schedules
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- On equivalence between the proportionate flow shop and single‐machine scheduling problems
- New Precedence Theorems for One-Machine Weighted Tardiness
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
This page was built for publication: The proportionate flow shop total tardiness problem
