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

DOI10.1016/S0377-2217(97)00129-XzbMATH Open0987.90037OpenAlexW2075696138MaRDI QIDQ1296695FDOQ1296695

Authors: Alain Guinet, Marie Legrand 

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

Recommendations

• Efficiency of reductions of job-shop to flow-shop problems
• scientific article; zbMATH DE number 1264301
• Flow shop scheduling problems under machine-dependent precedence constraints
• Shop scheduling problems under precedence constraints
• Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
• scientific article; zbMATH DE number 1054688
• An optimal method for the preemptive job shop scheduling problem
• A two-machine flowshop scheduling problem with precedence constraint on two jobs
• Resource constraints for preemptive job-shop scheduling
• Permutation Schedules for Flow Shops with Precedence Constraints

zbMATH Keywords

optimizationheuristicsschedulingflow-shopjob-shop environment

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
• A brief review on the reducibility of shop sequences minimizing some regular objectives
• Efficiency of reductions of job-shop to flow-shop problems
• No-wait job shop scheduling: tabu search and complexity of subproblems
• Approximative procedures for no-wait job shop scheduling.
• Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage

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

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