Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
From MaRDI portal
Publication:1893607
DOI10.1016/0307-904X(94)00022-XzbMath0829.90075OpenAlexW2011247778WikidataQ127975656 ScholiaQ127975656MaRDI QIDQ1893607
Publication date: 4 July 1995
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0307-904x(94)00022-x
mixed integer programmingcommon due datejob completion timestwo-machine flow shopminimization of the sum of absolute deviations
Related Items (11)
Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs ⋮ Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs ⋮ On the exact solution of the no-wait flow shop problem with due date constraints ⋮ Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date ⋮ Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey ⋮ On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties ⋮ Setting a common due date in a constrained flowshop: a variable neighbourhood search approach ⋮ Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval ⋮ Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem ⋮ A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research
Uses Software
Cites Work
- Scheduling about a common due date with earliness and tardiness penalties
- A V-shape property of optimal schedule of jobs about a common due date
- Scheduling problems with non-regular penalty functions - a review
- On two-machine scheduling with release and due dates to minimize maximum lateness
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- Single machine scheduling to minimize mean absolute lateness: A heuristic solution
- Optimal two- and three-stage production schedules with setup times included
- Some new results in flow shop scheduling
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Minimizing the average deviation of job completion times about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Minimizing mean absolute deviation of completion times about a common due date
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- The Single Machine Early/Tardy Problem
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Single-machine scheduling to minimize absolute deviation of completion times from a common due date
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Two-Stage Flowshop Scheduling Problem with Bicriteria
- Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
This page was built for publication: Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
