Reduction of job-shop problems to flow-shop problems with precedence constraints
From MaRDI portal
Publication:1296695
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
Cites work
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- scientific article; zbMATH DE number 3621663 (Why is no real title available?)
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A Computational Study of the Job-Shop Scheduling Problem
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- A Geometric Model and a Graphical Algorithm for a Sequencing Problem
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Review of Production Scheduling
- A Survey of Scheduling Rules
- A solvable case of the traveling salesman problem
- A survey and evaluation of static flowshop scheduling heuristics
- Adjustment of heads and tails for the job-shop problem
- An Algorithm for Solving the Job-Shop Problem
- An Evaluation of Flow Shop Sequencing Heuristics
- An Improved Formulation for the Job-Shop Scheduling Problem
- An efficient algorithm for the job-shop problem with two jobs
- Applying tabu search to the job-shop scheduling problem
- Flow Shop Problems with Time Lags
- Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Job-Shop Scheduling by Implicit Enumeration
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- Minimizing maximum lateness in a two-machine unit-time job shop
- Minimizing maximum lateness on one machine: computational experience and some applications
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- On two-machine scheduling with release and due dates to minimize maximum lateness
- Optimal two- and three-stage production schedules with set-up time included
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- Scheduling the General Job-Shop
- Sequency on two and three machines with setup, processing and removal times separated
- Surrogate duality relaxation for job shop scheduling
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations
- The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions
- The one-machine sequencing problem
- The two-machine sequence dependent flowshop scheduling problem
Cited in
(6)- Efficiency of reductions of job-shop to flow-shop problems
- Approximative procedures for no-wait job shop scheduling.
- Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage
- No-wait job shop scheduling: tabu search and complexity of subproblems
- 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
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)
