Focused Scheduling in Proportionate Flowshops

DOI10.1287/MNSC.31.7.852zbMATH Open0609.90067OpenAlexW2065331050MaRDI QIDQ3750503FDOQ3750503

Authors: Peng Ow Si 

Publication date: 1985

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.31.7.852

Recommendations

• The proportionate flow shop total tardiness problem
• Bottleneck-focused scheduling for a hybrid flowshop
• Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
• Proportionate flow shop with controllable processing times
• Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times

zbMATH Keywords

branch-and-boundproportionate flowshopbottlenecksfocused approachoptimal permutation schedulestotal tardiness cost of jobs

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)

Cited In (41)

• Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
• A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
• Online scheduling of ordered flow shops
• Minimizing makespan in an ordered flow shop with machine-dependent processing times
• Two-machine flow shop scheduling problem with an outsourcing option
• An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments
• Bottleneck-focused scheduling for a hybrid flowshop
• Heuristic methods and applications: A categorized survey
• Polynomial time approximation algorithms for proportionate open-shop scheduling
• Cooperative metaheuristics for the permutation flowshop scheduling problem
• Proportionate flow shop with controllable processing times
• A survey of priority rule-based scheduling
• The three-machine proportionate flow shop problem with unequal machine speeds
• Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
• Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
• On the complexity of proportionate open shop and job shop problems
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
• Approximation algorithms for the three-machine proportionate mixed shop scheduling
• Flow shops with machine maintenance: ordered and proportionate cases
• The job shop tardiness problem: A decomposition approach
• An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
• Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
• The proportionate flow shop total tardiness problem
• A note on makespan minimization in proportionate flow shops
• Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
• Single-machine and two-machine flowshop scheduling with general learning functions
• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
• Two-stage proportionate flexible flow shop to minimize the makespan
• Minimizing total tardiness on a two-machine re-entrant flowshop
• Minimizing total tardiness in permutation flowshops
• An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments
• A two-machine no-wait flow shop problem with two competing agents
• Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
• Flowshop scheduling with dominant machines
• Flow shops with reentry: reversibility properties and makespan optimal schedules
• Proportionate flowshops with general position-dependent processing times
• Review of the ordered and proportionate flow shop scheduling research
• Restricted neighborhood in the tabu search for the flowshop problem
• Proportionate flow shop: new complexity results and models with due date assignment
• An SA/TS mixture algorithm for the scheduling tardiness problem
• Scheduling in network flow shops

This page was built for publication: Focused Scheduling in Proportionate Flowshops

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