Pages that link to "Item:Q5422015"
From MaRDI portal
The following pages link to Multiplicity and complexity issues in contemporary production scheduling (Q5422015):
Displaying 6 items.
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- Identical coupled task scheduling: polynomial complexity of the cyclic case (Q906560) (← links)
- Throughput optimization in two-machine flowshops with flexible operations (Q983633) (← links)
- An approximate algorithm for a high-multiplicity parallel machine scheduling problem (Q991471) (← links)
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349) (← links)
- Cyclic lot-sizing problems with sequencing costs (Q2061136) (← links)
