On single-machine scheduling without intermediate delays
From MaRDI portal
Publication:955319
DOI10.1016/j.dam.2008.03.010zbMath1152.90436OpenAlexW2011999391MaRDI QIDQ955319
Publication date: 19 November 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.010
Related Items (11)
Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties ⋮ A greedy approximation algorithm for minimum-gap scheduling ⋮ No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines ⋮ A multivariate complexity analysis of the material consumption scheduling problem ⋮ 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 ⋮ On scheduling with the non-idling constraint ⋮ Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times ⋮ A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines ⋮ On scheduling with the non-idling constraint ⋮ Scheduling a single machine with primary and secondary objectives
Cites Work
- Complexity results for scheduling chains on a single machine
- The one-machine sequencing problem
- Scheduling equal-length jobs on identical parallel machines
- An exact approach to early/tardy scheduling with release dates
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
This page was built for publication: On single-machine scheduling without intermediate delays
