A better algorithm for sequencing with release and delivery times on identical machines
From MaRDI portal
Publication:4458881
Recommendations
- Scheduling Equal-Length Jobs with Delivery times on Identical Processors
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- A fast algorithm for multi-machine scheduling problems with jobs of equal processing times
- Scheduling identical jobs on uniform parallel machines
- Scheduling jobs with equal processing times and time windows on identical parallel machines
Cited in
(10)- Theoretical expectation versus practical performance of Jackson's heuristic
- Branch less, cut more and minimize the number of late equal-length jobs on identical machines
- Theoretical and practical issues in single-machine scheduling with two job release and delivery times
- Scheduling a single machine with primary and secondary objectives
- Parallel machine problems with equal processing times: a survey
- Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
- A study of single-machine scheduling problem to maximize throughput
- Scheduling Equal-Length Jobs with Delivery times on Identical Processors
- Parallel batch scheduling of equal-length jobs with release and due dates
- Bicriteria multi-machine scheduling with equal processing times subject to release dates
This page was built for publication: A better algorithm for sequencing with release and delivery times on identical machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458881)