Sequencing to Minimize the Maximum Job Cost

DOI10.1287/opre.28.4.942zbMath0423.68006OpenAlexW2078248576MaRDI QIDQ3857701

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

sequencing a set of jobsminimize the maximum job cost

Mathematics Subject Classification ID

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

Related Items (11)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Sequencing with general precedence constraints ⋮ Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity ⋮ 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 ⋮ Improving local search heuristics for some scheduling problems. II ⋮ Minimizing the makespan in a two-machine cross-docking flow shop problem ⋮ Single Machine General Maximum Cost Problem with Parallel-Chain Precedence Constraints ⋮ Effective optimization methods for single-machine scheduling (survey) ⋮ Algorithms for two-machine flow-shop sequencing with precedence constraints

This page was built for publication: Sequencing to Minimize the Maximum Job Cost