Group technology approach to the open shop scheduling problem with batch setup times

DOI10.1016/S0167-6377(00)00021-3zbMath0971.90034MaRDI QIDQ1577474

Vitaly A. Strusevich

Publication date: 22 November 2000

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(00)00021-3

zbMATH Keywords

approximation; open shop; batching; group technology

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B30: Production models

Related Items

Analysis of batched service time data using Gaussian and semi-parametric kernel models, A single machine carryover sequence-dependent group scheduling in PCB manufacturing, Group-scheduling problems in electronics manufacturing, A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Four decades of research on the open-shop scheduling problem to minimize the makespan, A survey of scheduling problems with setup times or costs, The routing open-shop problem on a network: complexity and approximation, Two-machine open shop problem with a single server and set-up time considerations

Cites Work

• Unnamed Item
• Approximation algorithms for two-machine flow shop scheduling with batch setup times
• Two-machine shop scheduling problems with batch processing
• Two machine open shop scheduling problem with setup, processing and removal times separated
• Optimal two- and three-stage production schedules with setup times included
• Open Shop Scheduling to Minimize Finish Time