Permutation-induced acyclic networks for the job shop scheduling problem

DOI10.1016/J.APM.2008.02.004MaRDI QIDQ840194zbMATH OpenOpenAlexFDO

Authors Tamer F. Abdelmaguid

Publication date 5 September 2009

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2008.02.004

zbMATH Keywords

exact algorithmsjob shop schedulingbranch-and-bounddisjunctive graph model

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 232391
• A permutation-based approach for solving the job-shop problem
• A new approach to computing optimal schedules for the job-shop scheduling problem
• On the combinatorial structure of the permutation flow shop problem
• The disjunctive graph machine representation of the job shop scheduling problem

Cites work

• scientific article; zbMATH DE number 1634827 (Why is no real title available?)
• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 3786461 (Why is no real title available?)
• A Computational Study of the Job-Shop Scheduling Problem
• A Method of Solution for General Machine-Scheduling Problems
• A branch and bound algorithm for the job-shop scheduling problem
• Algorithms for Solving Production-Scheduling Problems
• An Algorithm for Solving the Job-Shop Problem
• Benchmarks for basic scheduling problems
• Deterministic job-shop scheduling: Past, present and future
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• NP-hardness of shop-scheduling problems with three jobs
• The Complexity of Flowshop and Jobshop Scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• The one-machine sequencing problem

Cited in

(4)

• A tabu search approach for proportionate multiprocessor open shop scheduling
• A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times
• scientific article; zbMATH DE number 232391 (Why is no real title available?)
• Disjunctive graph based acyclic reconfigurable flow shop modeling and optimization

Describes a project that uses

Uses Software

• JOBSHOP

This page was built for publication: Permutation-induced acyclic networks for the job shop scheduling problem

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