One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective

DOI10.1080/10556780410001657653zbMath1054.90027OpenAlexW2079791948WikidataQ115005294 ScholiaQ115005294MaRDI QIDQ3156721

Mohammed Fazle Baki, Raymond G. Vickson

Publication date: 11 January 2005

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780410001657653

zbMATH Keywords

computational complexityschedulingpseudopolynomial algorithm

Mathematics Subject Classification ID

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

Related Items

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Two-machine open shop problem with a single server and set-up time considerations ⋮ A job-shop problem with one additional resource type ⋮ Scheduling with batching: A review ⋮ A survey of scheduling problems with setup times or costs ⋮ Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic

Cites Work

• Unnamed Item
• Batching in single operation manufacturing systems
• Scheduling a batching machine
• Scheduling with batching: Minimizing the weighted number of tardy jobs
• Scheduling multi-operation jobs on a single machine
• Scheduling with batching: A review
• Scheduling the production of two-component jobs on a single machine
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Scheduling of Products with Common and Product-Dependent Components Manufactured at a Single Facility
• Scheduling Groups of Jobs on a Single Machine