An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
From MaRDI portal
Publication:1319563
DOI10.1016/0377-2217(94)90331-XzbMath0799.90065OpenAlexW2088657581MaRDI QIDQ1319563
Publication date: 17 November 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90331-x
single-machine schedulingrelease timesworst-case analysisapproximation algorithmsdelivery timescontrollable job processing times
Related Items (1)
Cites Work
- A survey of results for sequencing problems with controllable processing times
- A block approach for single-machine scheduling with release dates and due dates
- A two-machine flow shop scheduling problem with controllable job processing times
- A bicriterion approach to time/cost trade-offs in sequencing
- The one-machine sequencing problem
- A multi-objective approach to resource allocation in single machine scheduling
- Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
- Job-shop scheduling with resource-time models of operations
- A Generalized Uniform Processor System
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The Theory of Networks and Management Science. Part I
This page was built for publication: An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times