Pages that link to "Item:Q1149374"
From MaRDI portal
The following pages link to On two-machine scheduling with release and due dates to minimize maximum lateness (Q1149374):
Displayed 17 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 two-machine flowshop scheduling problem with total tardiness (Q1115798) (← links)
- Job lateness in a two-machine flowshop with setup times separated (Q1184446) (← links)
- A fast tabu search algorithm for the permutation flow-shop problem (Q1278198) (← links)
- Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← links)
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications (Q1348546) (← links)
- Heuristic procedures for minimizing makespan and the number of required pallets (Q1390237) (← links)
- The permutation flow shop with buffers: A tabu search approach (Q1610144) (← links)
- A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
- Job-shop scheduling with resource-time models of operations (Q1820680) (← links)
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (Q1885958) (← links)
- Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem (Q1893607) (← links)
- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness (Q2563893) (← links)
- A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times (Q5937715) (← links)
- Minimizing tardiness in a two-machine flow-shop (Q5959377) (← links)