Reduction of job-shop problems to flow-shop problems with precedence constraints

DOI10.1016/S0377-2217(97)00129-XzbMath0987.90037OpenAlexW2075696138MaRDI QIDQ1296695

Marie Legrand, Alain Guinet

Publication date: 2 August 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00129-x

zbMATH Keywords

optimizationheuristicsschedulingflow-shopjob-shop environment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Approximative procedures for no-wait job shop scheduling. ⋮ No-wait job shop scheduling: tabu search and complexity of subproblems ⋮ Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage ⋮ Efficiency of reductions of job-shop to flow-shop problems

Cites Work

• Unnamed Item
• Unnamed Item
• The two-machine sequence dependent flowshop scheduling problem
• An efficient algorithm for the job-shop problem with two jobs
• On two-machine scheduling with release and due dates to minimize maximum lateness
• Minimizing maximum lateness in a two-machine unit-time job shop
• The one-machine sequencing problem
• Surrogate duality relaxation for job shop scheduling
• Adjustment of heads and tails for the job-shop problem
• Applying tabu search to the job-shop scheduling problem
• Optimal two- and three-stage production schedules with setup times included
• A survey and evaluation of static flowshop scheduling heuristics
• Flow Shop Problems with Time Lags
• On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
• Sequency on two and three machines with setup, processing and removal times separated
• Scheduling the General Job-Shop
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions
• Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case
• The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations
• A Review of Production Scheduling
• An Improved Formulation for the Job-Shop Scheduling Problem
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A Computational Study of the Job-Shop Scheduling Problem
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Minimizing maximum lateness on one machine: computational experience and some applications
• Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
• A Survey of Scheduling Rules
• Flowshop and Jobshop Schedules: Complexity and Approximation
• An Evaluation of Flow Shop Sequencing Heuristics
• Job-Shop Scheduling by Implicit Enumeration
• Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
• A Computational Study of Local Search Algorithms for Job Shop Scheduling
• A Geometric Model and a Graphical Algorithm for a Sequencing Problem
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
• A solvable case of the traveling salesman problem

This page was built for publication: Reduction of job-shop problems to flow-shop problems with precedence constraints