MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Constraint-Based Optimization and Approximation for Job-Shop Scheduling (1995) [19 citations — 2 self]

by Philippe Baptiste ,  Claude Le Pape ,  Wim Nuijten
In Proceedings of the AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems, IJCAI-95
Add To MetaCart

Abstract:

We present constraint-based optimization algorithms and a constraintbased approximation algorithm for the job-shop scheduling problem. An empirical performance analysis shows that both the optimization algorithms and the approximation algorithm perform well. Especially the approximation algorithm is among the best algorithms known to date. We, furthermore, show that we can improve the performance of the optimization algorithms by combining them with the approximation algorithm.

Citations

248 Introduction to sequencing and scheduling – Baker - 1974
130 A computational study of the job-shop scheduling problem – Applegate, Cook - 1991
109 A C ++ implementation of CLP – Puget - 1994
95 An algorithm for solving the job-shop problem – CARLIER, PINSON - 1989
60 Time and resource constrained scheduling: a constraint satisfaction approach – Nuijten - 1994
56 Parallel Taboo Search Techniques for the Job Shop Scheduling Problem – Taillard - 1994
49 Implementation of resource constraints in ilog schedule: A library for the development of constraint-based scheduling systems – Pape - 1994
44 A survey of scheduling rules – Panwalkar, Iskander - 1977
37 A Computational Study of Local Search Algorithms for Job–shop Scheduling – Aarts, Laarhoven, et al. - 1994
30 A controlled search simulated annealing method for the general job- shop scheduling problem – Matsuo, Suh, et al. - 1988
17 A survey of priority rule-based scheduling – Haupt - 1989
15 Solving the Job Shop Scheduling Problem using Tabu Search – Barnes, Chambers - 1995
10 A Fast Taboo Search Algorithm for the Job – Nowicki, Smutnicki - 1996
5 Trubian [1993] Applying tabu search to the job-shop scheduling problem – Dell’Amico, M
4 1992] Job shop scheduling by simulated annealing – Laarhoven, Aarts, et al.
2 1988], The shifting bottleneck procedure for job shop scheduling – Adams, Balas, et al.
2 Pape [1995], A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling – Baptiste, Le
2 Incorporating e cient Operations Research algorithms in constraint-based scheduling – Baptiste, Pape, et al. - 1995
1 1992], ABranch & Bound Algorithm for the Job-Shop Scheduling Problem, Working document – Brucker, Jurisch, et al.
1 Laburthe [1994], Improved CLP scheduling with task intervals – Caseau, F
1 1992], Evolution Based Learning in a Job Shop Environment, Working document – Dorndorf, Pesch
View or Download | Add to My Collection | Correct Errors