An exact approach to early/tardy scheduling with release dates
From MaRDI portal
Publication:1781563
DOI10.1016/J.COR.2004.04.016zbMATH Open1071.90541OpenAlexW2097852023MaRDI QIDQ1781563FDOQ1781563
Authors: Jorge M. S. Valente, Rui A. F. S. Alves
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
Recommendations
- Efficient approximation schemes for scheduling problems with release dates and delivery times
- scientific article; zbMATH DE number 40477
- scientific article; zbMATH DE number 1893571
- Scheduling about a common due date with earliness and tardiness penalties
- Preemptive scheduling with release dates, delivery times and sequence independent setup times
- Scheduling with job release dates, delivery times and preemption penalties
- Minimizing total tardiness on a single machine with unequal release dates
- scientific article; zbMATH DE number 40475
- Minimizing total completion time for preemptive scheduling with release dates and deadline constraints
- Scheduling to minimize release-time resource consumption and tardiness penalties
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Scheduling with release dates on a single machine to minimize total weighted completion time
- A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
- Title not available (Why is that?)
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- Single machine earliness and tardiness scheduling
- The Single Machine Early/Tardy Problem
- Improved heuristics for the early/tardy scheduling problem with no idle time
Cited In (14)
- New exact algorithms for one-machine earliness-tardiness scheduling
- Solving the earliness tardiness scheduling problem by DC programming and DCA
- Homogeneously non-idling schedules of unit-time jobs on identical parallel machines
- Single-machine scheduling with no idle time and release dates to~minimize a regular criterion
- Preemption in single machine earliness/tardiness scheduling
- Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness
- Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
- On single-machine scheduling without intermediate delays
- An improved particle swarm optimization algorithm for flowshop scheduling problem
- On scheduling with the non-idling constraint
- On scheduling with the non-idling constraint
This page was built for publication: An exact approach to early/tardy scheduling with release dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781563)