On scheduling around large restrictive common due windows
From MaRDI portal
Recommendations
- Single-machine scheduling with a common due window
- Scheduling problems with a common due window assignment: a survey
- Common due window size and location determination in a single machine scheduling problem
- scientific article; zbMATH DE number 7448659
- Earliness-tardiness scheduling problems with a common delivery window
Cites work
- scientific article; zbMATH DE number 2130220 (Why is no real title available?)
- scientific article; zbMATH DE number 1054928 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 855008 (Why is no real title available?)
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
- A single machine scheduling problem with common due window and controllable processing times
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
- Common due window size and location determination in a single machine scheduling problem
- Determination of common due window location in a single machine scheduling problem
- Due window scheduling for parallel machines
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Earliness-tardiness scheduling problems with a common delivery window
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Evolution strategies. A comprehensive introduction
- Guidelines for the use of meta-heuristics in combinatorial optimization.
- Minimizing the average deviation of job completion times about a common due date
- Optimal common due-date with completion time tolerance
- Optimal common due-date with limited completion time
- Optimal common due-date with limited completion time deviation
- Parallel machine scheduling with a common due window
- Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times
- Scheduling around a small common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single Machine Scheduling with a Common Delivery Window
- Single-machine scheduling with a common due window
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- The no free lunch theorems: complexity and security
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
Cited in
(9)- Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window
- Soft due window assignment and scheduling of unit-time jobs on parallel machines
- Tackling common due window problem with a two-layered approach
- Minmax scheduling problems with a common due-window
- Due-window assignment scheduling problem with stochastic processing times
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
- A survey on scheduling problems with due windows
- Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times
- Permutation flow shop scheduling with earliness and tardiness penalties
This page was built for publication: On scheduling around large restrictive common due windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704121)
