Permutation-induced acyclic networks for the job shop scheduling problem

DOI10.1016/j.apm.2008.02.004zbMath1168.90414OpenAlexW1994792214MaRDI QIDQ840194

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

branch-and-boundjob shop schedulingexact algorithmsdisjunctive graph model

Mathematics Subject Classification ID

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

Related Items (2)

A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times ⋮ A tabu search approach for proportionate multiprocessor open shop scheduling

Uses Software

• JOBSHOP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The one-machine sequencing problem
• A branch and bound algorithm for the job-shop scheduling problem
• Deterministic job-shop scheduling: Past, present and future
• NP-hardness of shop-scheduling problems with three jobs
• Benchmarks for basic scheduling problems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• A Computational Study of the Job-Shop Scheduling Problem
• The Complexity of Flowshop and Jobshop Scheduling
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• A Method of Solution for General Machine-Scheduling Problems
• Algorithms for Solving Production-Scheduling Problems

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