An exact approach to early/tardy scheduling with release dates
From MaRDI portal
Publication:1781563
DOI10.1016/J.COR.2004.04.016zbMath1071.90541OpenAlexW2097852023MaRDI QIDQ1781563
Rui A. F. S. Alves, Jorge M. S. Valente
Publication date: 27 June 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/2905
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (9)
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem ⋮ Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders ⋮ Single-machine scheduling with no idle time and release dates to~minimize a regular criterion ⋮ Homogeneously non-idling schedules of unit-time jobs on identical parallel machines ⋮ Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness ⋮ On scheduling with the non-idling constraint ⋮ On single-machine scheduling without intermediate delays ⋮ On scheduling with the non-idling constraint ⋮ An improved particle swarm optimization algorithm for flowshop scheduling problem
Cites Work
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- Scheduling with release dates on a single machine to minimize total weighted completion time
- Single machine earliness and tardiness scheduling
- A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
- Improved heuristics for the early/tardy scheduling problem with no idle time
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- The Single Machine Early/Tardy Problem
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- Unnamed Item
This page was built for publication: An exact approach to early/tardy scheduling with release dates
