Proportionate flow shop with controllable processing times

DOI10.1002/(SICI)1099-1425(199911/12)2:6%3C253::AID-JOS30%3E3.0.CO;2-RMaRDI QIDQ1964482zbMATH OpenFDO

Authors T. C. Edwin Cheng, N. V. Shakhlevich

Publication date 3 April 2000

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

Full work available at URL https://doi.org/10.1002/(SICI)1099-1425(199911/12)2:6%3C253::AID-JOS30%3E3.0.CO;2-R

zbMATH Keywords

controllable processing timesflow shop schedulingmultiple criteria

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Multi-objective and goal programming (90C29)

Recommendations

• Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
• Minimizing total weighted completion time in a proportionate flow shop
• The three-machine proportionate flow shop problem with unequal machine speeds
• A two-machine flow shop scheduling problem with controllable job processing times
• Proportionate flowshops with general position-dependent processing times

Cites work

• A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine
• A survey of results for sequencing problems with controllable processing times
• A two-machine flow shop scheduling problem with controllable job processing times
• An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Complexity of single machine hierarchical scheduling: A survey
• Focused Scheduling in Proportionate Flowshops
• scientific article; zbMATH DE number 52239 (Why is no real title available?)
• Minimizing total weighted completion time in a proportionate flow shop
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

Cited in

(18)

• Minimizing total weighted completion time in a proportionate flow shop
• The three-machine proportionate flow shop problem with unequal machine speeds
• Approximation schemes for parallel machine scheduling problems with controllable processing times
• Two-stage proportionate flexible flow shop to minimize the makespan
• Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
• A survey of scheduling with controllable processing times
• Approximation schemes for job shop scheduling problems with controllable processing times
• Multicriteria scheduling
• Focused Scheduling in Proportionate Flowshops
• On equivalence between the proportionate flow shop and single-machine scheduling problems
• Proportionate flow shop: new complexity results and models with due date assignment
• Two-machine flow shop scheduling with convex resource consumption functions
• Proportionate flow shop scheduling with job-dependent due windows and position-dependent weights
• Two-agent proportionate flowshop scheduling with deadlines: polynomial-time optimization algorithms
• Coordinating scheduling and resource allocation decisions in a proportionate flow-shop scheduling environment
• Proportionate flow shop games
• Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
• A search method for optimal control of a flow shop system of traditional machines

This page was built for publication: Proportionate flow shop with controllable processing times

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