An online algorithm for a problem in scheduling with set-ups and release times
DOI10.1007/S00453-009-9337-9zbMATH Open1215.68275OpenAlexW2016555341MaRDI QIDQ534771FDOQ534771
Authors: Srikrishnan Divakaran, Michael Saks 
Publication date: 10 May 2011
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-009-9337-9
Recommendations
online algorithmsoperations researchanalysis of algorithmsapproximation algorithmsbatch schedulingscheduling with set-ups
Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Scheduling with batching: A review
- Scheduling Groups of Jobs on a Single Machine
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- On the Complexity of Scheduling with Batch Setup Times
- Batch scheduling to minimize total completion time
- Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
- Single facility scheduling with multiple job classes
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
- Single facility multi-class job scheduling
- Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
- A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times
- Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
- Single machine scheduling with batch set-up times to minimize maximum lateness
- Minimizing maximum lateness with job families
- Approximation algorithms for problems in scheduling with set-ups
- Title not available (Why is that?)
- Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
- Title not available (Why is that?)
- Solving a Class Scheduling Problem with a Genetic Algorithm
- An online algorithm for a problem in scheduling with set-ups and release times
Cited In (9)
- An online algorithm for a problem in scheduling with set-ups and release times
- Single machine batch scheduling with release times
- Non-preemptive scheduling on machines with setup times
- Approximation algorithms for problems in scheduling with set-ups
- Combining request scheduling with web caching
- On competitive analysis for polling systems
- Non-clairvoyant scheduling to minimize MAX flow time on a machine with setup times
- Online machine scheduling with family setups
- An optimal online algorithm for scheduling two machines with release times
This page was built for publication: An online algorithm for a problem in scheduling with set-ups and release times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534771)
