Two-machine flow shop scheduling with a common due date to maximize total early work
From MaRDI portal
Publication:2116855
DOI10.1016/j.ejor.2021.07.055zbMath1495.90067OpenAlexW3193438168WikidataQ115198388 ScholiaQ115198388MaRDI QIDQ2116855
Qian Miao, Xin Chen, Małgorzata Sterna, Bertrand M. T. Lin, Jacek Błażewicz
Publication date: 18 March 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.07.055
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (2)
Maximizing total early work in a distributed two‐machine flow‐shop ⋮ Exact approaches to late work scheduling on unrelated machines
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey on offline scheduling with rejection
- Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
- Semi-online scheduling on two identical machines with a common due date to maximize total early work
- Approximation algorithms for scheduling a single machine to minimize total late work
- Open shop scheduling problems with late work criteria.
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- The two-machine flow-shop problem with weighted late work criterion and common due date
- Mirror scheduling problems with early work and late work criteria
- A common approximation framework for early work, late work, and resource leveling problems
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- Optimal two- and three-stage production schedules with setup times included
- Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
- Single Machine Scheduling to Minimize Total Late Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
- Two-machine flow-shop scheduling to minimize total late work: revisited
- Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work
- An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines
- KI 2005: Advances in Artificial Intelligence
- Two‐agent scheduling with linear resource‐dependent processing times
This page was built for publication: Two-machine flow shop scheduling with a common due date to maximize total early work