Pages that link to "Item:Q4458881"
From MaRDI portal
The following pages link to A better algorithm for sequencing with release and delivery times on identical machines (Q4458881):
Displayed 9 items.
- Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time (Q391321) (← links)
- A study of single-machine scheduling problem to maximize throughput (Q398860) (← links)
- Parallel batch scheduling of equal-length jobs with release and due dates (Q600846) (← links)
- Theoretical expectation versus practical performance of Jackson's heuristic (Q1665791) (← links)
- Branch less, cut more and minimize the number of late equal-length jobs on identical machines (Q1929241) (← links)
- Theoretical and practical issues in single-machine scheduling with two job release and delivery times (Q2066683) (← links)
- Scheduling a single machine with primary and secondary objectives (Q2331605) (← links)
- Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
- Bicriteria multi-machine scheduling with equal processing times subject to release dates (Q6145328) (← links)