Some new results in flow shop scheduling

DOI10.1007/BF01919082MaRDI QIDQ3312010zbMATH OpenOpenAlexFDO

Authors H. Rock

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)

Cites work

• scientific article; zbMATH DE number 3825546 (Why is no real title available?)
• scientific article; zbMATH DE number 3757695 (Why is no real title available?)
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Flowshop scheduling with limited temporary storage
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
• Scheduling subject to resource constraints: Classification and complexity
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• The Complexity of Flowshop and Jobshop Scheduling
• Unit Execution Time Shop Problems

Cited in

(37)

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

This page was built for publication: Some new results in flow shop scheduling

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