Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window
From MaRDI portal
Publication:6164365
DOI10.1016/j.cor.2023.106159MaRDI QIDQ6164365
Gustavo Alencar Rolim, Bruno de Athayde Prata, Marcelo Seido Nagano
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- On scheduling around large restrictive common due windows
- Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date
- Scheduling identical jobs and due-window on uniform machines
- Due window scheduling for parallel machines
- A survey of the state-of-the-art of common due date assignment and scheduling research
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
- Greedy randomized adaptive search procedures
- Soft due window assignment and scheduling of unit-time jobs on parallel machines
- Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times
- Due-window assignment with identical jobs on parallel uniform machines
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs
- Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs
- A survey on scheduling problems with due windows
- Just-in-time scheduling for a distributed concrete precast flow shop system
- Permutation flow shop scheduling with earliness and tardiness penalties
- Minimizing the average deviation of job completion times about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date
- Due-window assignment with unit processing-time jobs
- Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
- Parallel machine scheduling with a common due window
- An exact quadratic programming approach based on convex reformulation for seru scheduling problems
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
This page was built for publication: Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window