Two-machine shop scheduling problems with batch processing

DOI10.1016/0895-7177(93)90196-6zbMath0776.90037OpenAlexW1997499543MaRDI QIDQ1802481

Ulf Kleinau

Publication date: 21 July 1993

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(93)90196-6

zbMATH Keywords

makespanflow shopNP-hardbatch processing complexitytwo machine shop scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (18)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ A comprehensive review of flowshop group scheduling literature ⋮ Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass ⋮ An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem ⋮ On the number of feasible schedules of the open-shop-problem-an application of special latin rectangles ⋮ Scheduling with batching: A review ⋮ A survey of scheduling problems with setup times or costs ⋮ Open-shop batch scheduling with identical jobs ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Irreducible bin packing and normality in routing open shop ⋮ The routing open-shop problem on a network: complexity and approximation ⋮ A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network ⋮ Heuristics for permutation flow shop scheduling with batch setup times ⋮ A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing ⋮ Approximation algorithms for two-machine flow shop scheduling with batch setup times ⋮ Group technology approach to the open shop scheduling problem with batch setup times ⋮ A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size ⋮ The complexity of two group scheduling problems

Cites Work

• One-pass batching algorithms for the one-machine problem
• Batching to Minimize Flow Times on One Machine
• Open Shop Scheduling to Minimize Finish Time
• On the Complexity of Scheduling with Batch Setup Times

This page was built for publication: Two-machine shop scheduling problems with batch processing