Abstract
The scheduling of manufacturing processes aims to find sequences of jobs on given machines optimal by a selected criterion, e.g. minimal completion time of all operations. With respect to NP-hardness of these problems and the necessity to solve them by heuristic methods, the problem representation and the effectiveness of their procedures is substantial for computations to be completed in a reasonable amount of time. In this paper, we deal with job shop scheduling problem (JSSP) in a disjunctive graph-based representation. Turning all undirected edges into directed ones, the problem is transformed to a problem solvable by the Critical Path Method (CPM). We propose an original implementation of the CPM that makes it possible to decrease its time complexity and thus also the running time of all JSSP iterations.
References
[1]
{1} A. Azaron, C. Perkgoz and M. Sakawa, A Genetic Algorithm for the Time-Cost Trade-off in PERT Networks, Applied Mathematics and Computation, Vol. 168, 2005, pp. 1317-1339.
[2]
{2} E. Balas and A. Vazacopoulos, Guided Local Search with Shifting Bottleneck for Job Shop Scheduling, Management Science, Vol. 44, 1998, pp. 262-275.
[3]
{3} J. Blazewicz, K. H. Ecker, G. Schmidt and J. Weglarz, Scheduling Computer and Manufacturing Processes, Springer-Verlag, Berlin, 1996.
[4]
{4} R. Cheng, M. Gen and Y. Tsujimura, A Tutorial Survey of Job-Shop Scheduling Problems Using Genetic Algorithms - I. Representation, Computers & Industrial Engineering, Vol. 30, No. 4, 1996, pp. 983-997.
[5]
{5} T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, MIT Press, Cambridge, Massachusetts, 2001.
[6]
{6} A. El-Bouri, N. Azizi, S. Zolfaghari, A Comparative Study of a New Heuristic Based on Adaptive Memory Programming and Simulated Annealing: The Case of Job Shop Scheduling, European Journal of Operational Research, 2007, 17 pp., in press.
[7]
{7} S. E. Elmaghraby, Activity Networks: Project Planning and Control by Network Models, John Wiley & Sons, New York, 1977.
[8]
{8} S. M. T. F. Ghomi and E. Teimouri, Path Critical Index and Activity Critical Index in PERT Networks, European Journal of Operational Research, Vol. 141, 2002, pp. 147-152.
[9]
{9} J. Goncalves, J. de Magalhaes-Mendes and M. Resende, A Hybrid Genetic Algorithm for the Job Shop Scheduling Problem, European Journal of Operational Research, Vol. 167, 2005, pp. 77-95.
[10]
{10} Z. Michalewicz and D. B. Fogel, How to Solve It: Modern Heuristics, Springer-Verlag, Berlin, 2002.
[11]
{11} E. Nowicki and C. Smutnicki, A Fast Taboo Search Algorithm for the Job Shop Problem, Management Science, Vol. 42, 1996, pp. 797-813.
[12]
{12} C. R. Reeves, Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, 1993.
[13]
{13} R. Vaessens, E. Aarts and J. Lenstra, Job Shop Scheduling by Local Search, INFORMS Journal on Computing, Vol. 8, 1996, pp. 302-317.
[14]
{14} J. P. Watson, A. Howe and L. Whitley, Deconstructing Nowicki and Smutnicki's i-TSAB Tabu Search Algorithm for the Job-Shop Scheduling Problem, Computers & Operations Research, Vol. 33, 2006, pp. 2623-2644.
[15]
{15} H. Wenqi and Y. Aihua, An Improved Shifting Bottleneck Procedure for the Job Shop Scheduling Problem, Computers & Operations Research, Vol. 31, 2004, pp. 2093-2110.
Index Terms
- An implementation view on job shop scheduling based on CPM
Recommendations
Constraint-Based Job Shop Scheduling with {\sc Ilog\ Scheduler}
We introduce constraint-based scheduling and discuss its main principles. An approximation algorithm based on tree search is developed for the job shop scheduling problem using {\sc Ilog\ Scheduler} . A new way of calculating lower bounds on the ...
Heuristic Optimization for Dual-resource Constrained Job Shop Scheduling
CAR '09: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and RoboticsIn the study of job shop scheduling problem in mass injection molding processing enterprises, the practical job shop scheduling environment cannot be mirrored in the traditional study only considering machine resources. A dual-resource (machines and ...
The blocking job shop with rail-bound transportation
The blocking job shop with rail-bound transportation (BJS-RT) considered here is a version of the job shop scheduling problem characterized by the absence of buffers and the use of a rail-bound transportation system. The jobs are processed on machines ...
Comments
Information & Contributors
Information
Published In
July 2007
694 pages
ISBN:9789608457959
Publisher
World Scientific and Engineering Academy and Society (WSEAS)
Stevens Point, Wisconsin, United States
Publication History
Published: 26 July 2007
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 5Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in