Focused Scheduling in Proportionate Flowshops
From MaRDI portal
Publication:3750503
DOI10.1287/mnsc.31.7.852zbMath0609.90067OpenAlexW2065331050MaRDI QIDQ3750503
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
branch-and-boundproportionate flowshopbottlenecksfocused approachoptimal permutation schedulestotal tardiness cost of jobs
Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)
Related Items
Flowshop scheduling with dominant machines, An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments, Minimizing maximum completion time in a proportionate flow shop with one machine of different speed, Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times, Single-machine and two-machine flowshop scheduling with general learning functions, A survey of priority rule-based scheduling, Minimizing total tardiness in permutation flowshops, An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines, Minimizing makespan in an ordered flow shop with machine-dependent processing times, Two-machine flow shop scheduling problem with an outsourcing option, A note on makespan minimization in proportionate flow shops, Proportionate flowshops with general position-dependent processing times, On the complexity of proportionate open shop and job shop problems, Two-stage proportionate flexible flow shop to minimize the makespan, Proportionate flow shop with controllable processing times, Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics, Online scheduling of ordered flow shops, Cooperative metaheuristics for the permutation flowshop scheduling problem, Restricted neighborhood in the tabu search for the flowshop problem, A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem, Flow shops with machine maintenance: ordered and proportionate cases, Flow shops with reentry: reversibility properties and makespan optimal schedules, Approximation algorithms for the three-machine proportionate mixed shop scheduling, A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops, The three-machine proportionate flow shop problem with unequal machine speeds, An SA/TS mixture algorithm for the scheduling tardiness problem, Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, Heuristic methods and applications: A categorized survey, 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, Minimizing total tardiness on a two-machine re-entrant flowshop, Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness, Scheduling in network flow shops, Polynomial time approximation algorithms for proportionate open‐shop scheduling, Proportionate flow shop: New complexity results and models with due date assignment, The job shop tardiness problem: A decomposition approach
