The complexity of two group scheduling problems

DOI10.1002/JOS.118MaRDI QIDQ1860372zbMATH OpenOpenAlexWikidataFDO

Authors M. Y. Kovalyov, Jacek Blazewicz

Publication date 23 February 2003

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jos.118

zbMATH Keywords

group technologyopen shopparallel machinesscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Two-machine shop scheduling problems with batch processing
• Scheduling groups of unit length jobs on two identical parallel machines.
• Group technology approach to the open shop scheduling problem with batch setup times
• Two scheduling problems in group technology with deteriorating jobs
• Minimizing the number of late jobs under the group technology assumption

Cites work

• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Minimizing the number of late jobs under the group technology assumption
• Open Shop Scheduling to Minimize Finish Time
• Parallel Machine Scheduling with Batch Setup Times
• Scheduling Groups of Jobs on a Single Machine
• Scheduling with batching: A review
• The complexity of scheduling job families about a common due date
• Two-machine shop scheduling problems with batch processing

Cited in

(16)

• Minimizing the number of late jobs under the group technology assumption
• Two-machine group scheduling problem with blocking and anticipatory setups
• Two-machine flowshop group scheduling problem
• Group technology approach to the open shop scheduling problem with batch setup times
• Scheduling groups of unit length jobs on two identical parallel machines.
• An introduction to multi-parameter complexity analysis of discrete problems
• Two-machine shop scheduling problems with batch processing
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
• A survey of scheduling problems with setup times or costs
• Group scheduling on two cells with intercell movement
• Two-machine shop scheduling: Compromise between flexibility and makespan value
• Group scheduling in a two-stage flowshop
• scientific article; zbMATH DE number 1877047 (Why is no real title available?)
• Sequential-Merge Facets for Two-Dimensional Group Problems
• Single machine scheduling with assignable due dates to minimize maximum and total late work

This page was built for publication: The complexity of two group scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1860372)