Pages that link to "Item:Q5671775"
From MaRDI portal
The following pages link to On sequencing with earliest starts and due dates with application to computing bounds for the (<i>n/m/G/F</i><sub>max</sub>) problem (Q5671775):
Displaying 12 items.
- A block approach for single-machine scheduling with release dates and due dates (Q1083026) (← links)
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan (Q1091256) (← links)
- The one-machine sequencing problem (Q1162927) (← links)
- Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
- An approximation algorithm for a single-machine scheduling problem with release times and delivery times (Q1314328) (← links)
- Theoretical expectation versus practical performance of Jackson's heuristic (Q1665791) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Theoretical and practical issues in single-machine scheduling with two job release and delivery times (Q2066683) (← links)
- Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem (Q2569091) (← links)
- Minimizing maximum lateness on one machine: computational experience and some applications (Q4103320) (← links)
- Scheduling Equal-Length Jobs with Delivery times on Identical Processors (Q4551464) (← links)
- A new approach to computing optimal schedules for the job-shop scheduling problem (Q4645937) (← links)
