A note on a due-date assignment on a two-machine flow-shop
From MaRDI portal
Publication:1765554
DOI10.1016/S0305-0548(02)00225-3zbMath1057.90011OpenAlexW2057252633MaRDI QIDQ1765554
Publication date: 23 February 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00225-3
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Optimal due date assignment in multi-machine scheduling environments, Two due date assignment problems in scheduling a single machine, Scheduling with due date assignment under special conditions on job processing, Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem, Due date assignments and scheduling a single machine with a general earliness/tardiness cost function, Minmax due-date assignment on a two-machine flowshop, Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments, Optimal due date assignment and resource allocation in a group technology scheduling environment, Minmax scheduling problems with a common due-window, Due-date assignment on uniform machines, Johnson's rule, composite jobs and the relocation problem, Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms
Cites Work
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Minimizing tardy jobs in a flowshop with common due date
- Optimal two- and three-stage production schedules with setup times included
- Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
- A common due-data assignment problem on parallel identical machines