Sequencing to Minimize the Maximum Job Cost

DOI10.1287/OPRE.28.4.942MaRDI QIDQ3857701zbMATH OpenOpenAlexFDO

Authors Clyde l. Monma

Publication date 1980

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.28.4.942

zbMATH Keywords

minimize the maximum job costsequencing a set of jobs

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25)

Cited in

(11)

• Sequencing with general precedence constraints
• Sequencing to minimize the maximum renewal cumulative cost
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity
• Minimizing the makespan in a two-machine cross-docking flow shop problem
• Single Machine General Maximum Cost Problem with Parallel-Chain Precedence Constraints
• A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
• Improving local search heuristics for some scheduling problems. II
• Effective optimization methods for single-machine scheduling (survey)
• Algorithms for two-machine flow-shop sequencing with precedence constraints
• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations

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)