Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
From MaRDI portal
Publication:947941
DOI10.1016/j.cor.2007.07.005zbMath1163.90512OpenAlexW2069503245MaRDI QIDQ947941
Débora P. Ronconi, Francis Sourd, Celso Satoshi Sakuraba
Publication date: 8 October 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.07.005
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows, Recent progress of local search in handling the time window constraints of the vehicle routing problem, Recent progress of local search in handling the time window constraints of the vehicle routing problem, 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, 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
Cites Work
- A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date
- An improved earliness--tardiness timing algorithm
- Minimizing total tardiness in permutation flowshops
- A survey of the state-of-the-art of common due date assignment and scheduling research
- On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
- PERT scheduling with convex cost functions.
- Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
- Benchmarks for basic scheduling problems
- Optimal two- and three-stage production schedules with setup times included
- 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
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Comparative evaluation of MILP flowshop models
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates