Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
From MaRDI portal
Publication:4145413
DOI10.1287/mnsc.23.9.1016zbMath0367.90077OpenAlexW2170525601MaRDI QIDQ4145413
Publication date: 1977
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.23.9.1016
Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)
Related Items
Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem ⋮ Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach ⋮ The two-machine flowshop scheduling problem with total tardiness ⋮ A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop ⋮ Minimizing total tardiness in permutation flowshops ⋮ Two-machine flowshop scheduling to minimize total tardiness ⋮ An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system ⋮ Job lateness in a two-machine flowshop with setup times separated ⋮ Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness ⋮ A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness ⋮ Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study ⋮ A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process ⋮ Minimizing total flowtime and maximum job lateness in the twomachine flowshop system: a computerized algorithm ⋮ Minimizing total tardiness on a two-machine re-entrant flowshop ⋮ Reduction of job-shop problems to flow-shop problems with precedence constraints ⋮ Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
