Pages that link to "Item:Q3055251"
From MaRDI portal
The following pages link to Permutation flow shops with exact time lags to minimise maximum lateness (Q3055251):
Displaying 13 items.
- The two-machine no-wait general and proportionate open shop makespan problem (Q296784) (← links)
- Minimizing total tardiness in permutation flowshops (Q1127155) (← links)
- Scheduling permutation flow shops using the Lagrangian relaxation technique (Q1374432) (← links)
- Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags (Q2018863) (← links)
- Coupled task scheduling with exact delays: literature review and models (Q2282490) (← links)
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (Q2356207) (← links)
- Polynomial time algorithms for the UET permutation flowshop problem with time delays (Q2384903) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- Permutation flowshop scheduling problems with maximal and minimal time lags (Q2581596) (← links)
- Permutation flow shop scheduling with earliness and tardiness penalties (Q3055278) (← links)
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm (Q3605449) (← links)
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints (Q4921223) (← links)
- Minimizing maximum lateness in a flow shop subject to release dates (Q5292803) (← links)
