An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times

DOI10.1016/0377-2217(93)90246-JzbMath0796.90032OpenAlexW2070979829MaRDI QIDQ1310020

Eugeniusz Nowicki

Publication date: 20 December 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90246-j

zbMATH Keywords

makespanworst-case analysismaximum completion timeapproximate algorithmworst-case performance ratio\(m\)-machine permutation flow shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Approximation schemes for parallel machine scheduling problems with controllable processing times ⋮ A survey of scheduling with controllable processing times ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness ⋮ Proportionate flow shop with controllable processing times ⋮ Two-machine open shop problem with controllable processing times ⋮ Approximation schemes for job shop scheduling problems with controllable processing times ⋮ A search method for optimal control of a flow shop system of traditional machines ⋮ Two-stage production scheduling with an outsourcing option

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of results for sequencing problems with controllable processing times
• A two-machine flow shop scheduling problem with controllable job processing times
• Worst-case analysis of an approximation algorithm for flow-shop scheduling
• An adaptive branching rule for the permutation flow-shop problem
• A bicriterion approach to time/cost trade-offs in sequencing
• A multi-objective approach to resource allocation in single machine scheduling
• Job-shop scheduling with resource-time models of operations
• Optimal two- and three-stage production schedules with setup times included
• On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
• A Generalized Uniform Processor System
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Theory of Networks and Management Science. Part I

This page was built for publication: An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times