Pages that link to "Item:Q3857701"
From MaRDI portal
The following pages link to Sequencing to Minimize the Maximum Job Cost (Q3857701):
Displayed 9 items.
- A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden (Q579120) (← links)
- Effective optimization methods for single-machine scheduling (survey) (Q786645) (← links)
- Algorithms for two-machine flow-shop sequencing with precedence constraints (Q800822) (← links)
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations (Q958450) (← links)
- Sequencing with general precedence constraints (Q1142151) (← links)
- Sequencing to minimize the maximum renewal cumulative cost (Q1200775) (← links)
- Minimizing the makespan in a two-machine cross-docking flow shop problem (Q2519078) (← links)
- Single Machine General Maximum Cost Problem with Parallel-Chain Precedence Constraints (Q3912345) (← links)
- Improving local search heuristics for some scheduling problems. II (Q5961605) (← links)