The shifting bottleneck procedure for job shop scheduling
Management Science
Better approximation guarantees for job-shop scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
SIAM Journal on Discrete Mathematics
A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
Computers and Operations Research
Job Shop Scheduling with Unit Processing Times
Mathematics of Operations Research
A very fast TS/SA algorithm for the job shop scheduling problem
Computers and Operations Research
Ant colony optimization combined with taboo search for the job shop scheduling problem
Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
A multi-modal immune algorithm for the job-shop scheduling problem
Information Sciences: an International Journal
Principles of Sequencing and Scheduling
Principles of Sequencing and Scheduling
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
An efficient job-shop scheduling algorithm based on particle swarm optimization
Expert Systems with Applications: An International Journal
Properties of optimal schedules in preemptive shop scheduling
Discrete Applied Mathematics
Mathematical models for preemptive shop scheduling problems
Computers and Operations Research
A job shop scheduling heuristic for varying reward structures
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.01 |
In this study, a powerful solution methodology is developed for minimizing makespan in the preemptive Job Shop Scheduling Problem (pJSSP). Some new properties of the problem are stated and proved via theorems on the basis of which a new dominant set is introduced for the problem. These properties give rise to a dramatic decrease in the search space and provide the potential for exact methods to be successfully used in the solution of this notoriously NP-hard problem. The exact method presented here is a branch and bound algorithm developed on the basis of a new disjunctive graph. Its efficiency is enhanced by the effective use of such techniques as dominance rules or lower bounds. The capability of the approach is investigated by using it to solve the well-known benchmark problems and comparing the results obtained with those from the best methods in common use. The results indicate that the proposed method is capable of optimally solving 24 open benchmark problems including the famous 10x10 problems. Additionally, it is the first optimal method ever developed to find optimal solutions to some large-scale problems of the size 30x10 and 50x10.