Sequencing to Minimize the Maximum Job Cost
From MaRDI portal
Publication:3857701
Cited in
(11)- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
- Sequencing to minimize the maximum renewal cumulative cost
- A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
- Sequencing with general precedence constraints
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Improving local search heuristics for some scheduling problems. II
- Single Machine General Maximum Cost Problem with Parallel-Chain Precedence Constraints
- Effective optimization methods for single-machine scheduling (survey)
- Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity
- Algorithms for two-machine flow-shop sequencing with precedence constraints
- Minimizing the makespan in a two-machine cross-docking flow shop problem
This page was built for publication: Sequencing to Minimize the Maximum Job Cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3857701)