Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
From MaRDI portal
Publication:868990
DOI10.1016/j.cor.2005.09.002zbMath1144.90403MaRDI QIDQ868990
Publication date: 26 February 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.09.002
scheduling; lateness; network flows; binary search; availability constraint; eligibility constraint; machines with identical speed
90B36: Stochastic scheduling theory in operations research
Related Items
Exponential inapproximability and FPTAS for scheduling with availability constraints, MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel machines scheduling with nonsimultaneous machine available time
- NP-complete scheduling problems
- Current trends in deterministic scheduling
- Scheduling multiprocessor tasks on parallel processors with limited availability.
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- Scheduling preemptable tasks on parallel processors with limited availability
- Parallel machines scheduling with machine shutdowns
- Parallel machine scheduling under a grade of service provision
- A note on parallel machine scheduling with non-simultaneous machine available time
- Scheduling with limited machine availability
- Machine scheduling with an availability constraint
- Scheduling with Deadlines and Loss Functions
- Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
- Minimizing makespan on parallel machines with release time and machine eligibility restrictions
