Some new results in flow shop scheduling

DOI10.1007/BF01919082zbMath0529.90059OpenAlexW1982276972MaRDI QIDQ3312010

H. Röck

Publication date: 1984

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01919082

zbMATH Keywords

NP-hardnesssingle resource constraint2-machine flow shopsminimal maximum latenessminimal mean flow timeno wait in process

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items

Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking, Some no-wait shops scheduling problems: Complexity aspect, Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph, Scheduling tasks on two processors with deadlines and additional resources, Minimizing mean flow time with parallel processors and resource constraints, Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem, Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs, Job shop scheduling with unit time operations under resource constraints and release dates, Optimizing blocking flow shop scheduling problem with total completion time criterion, On the exact solution of the no-wait flow shop problem with due date constraints, Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time, On a scheduling problem in a robotized analytical system, Flexible flow shop with dedicated buffers, Scheduling unit-time tasks in renewable resource constrained flowshops, Open shop scheduling with synchronization, No-wait flowshops with bicriteria of makespan and maximum lateness., Flow shop scheduling problem with conflict graphs, Two machine flow shop scheduling problem with weighted WIP costs, No-wait flowshop scheduling problem with two criteria; total tardiness and makespan, Decomposition algorithms for synchronous flow shop problems with additional resources and setup times, The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time, Flow shops with WIP and value added costs, No-wait or no-idle permutation flowshop scheduling with dominating machines, Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion, Complexity results for flow shop problems with synchronous movement, Coupled task scheduling with exact delays: literature review and models, No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan, Minimizing total completion time in two-machine flow shops with exact delays, Algorithms for minimizing maximum lateness with unit length tasks and resource constraints, A two-machine no-wait flow shop problem with two competing agents, Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays, A review of TSP based approaches for flowshop scheduling, SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS, The complexity of scheduling jobs in repetitive manufacturing systems, Nonpreemptive flowshop scheduling with machine dominance, Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling subject to resource constraints: Classification and complexity
• Optimal two- and three-stage production schedules with setup times included
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
• Flowshop scheduling with limited temporary storage
• Unit Execution Time Shop Problems
• Flowshop and Jobshop Schedules: Complexity and Approximation
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• On the Flow-Shop Sequencing Problem with No Wait in Process^†