Access the full text.
Sign up today, get DeepDyve free for 14 days.
Huy Phan, G. Fandel, W. Trockel (2000)
Constraint Propagation in Flexible Manufacturing
Paul Martin, D. Shmoys (1996)
A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem
P. Brucker, S. Knust, Arno Schoo, Olaf Thiele (1998)
A branch and bound algorithm for the resource-constrained project scheduling problemEur. J. Oper. Res., 107
KumarVipin (1992)
Algorithms for constraint-satisfaction problemsAi Magazine
U. Dorndorf, E. Pesch, Toàn Phan-Huy (2000)
A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence ConstraintsManagement Science, 46
J. Błażewicz, K. Ecker, E. Pesch, G. Schmidt, J. Weglarz (2001)
Scheduling Computer and Manufacturing ProcessesJournal of the Operational Research Society, 48
P. Brucker, Bernd Jurisch, Andreas Krämer (1994)
The job-shop problem and immediate selectionAnnals of Operations Research, 50
J. Adams, E. Balas, D. Zawack (1988)
The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 34
U. Dorndorf, T. Huy, E. Pesch (1999)
A Survey of Interval Capacity Consistency Tests for Time- and Resource-Constrained Scheduling
(1989)
Consistency and satissability in constraint satisfaction problems
Wim Nuijten, C. Pape (1998)
Constraint-Based Job Shop Scheduling with IILOG SCHEDULERJournal of Heuristics, 3
PinsonE. (1991)
A practical use of Jackson's preemptive schedule for solving the job shop problemAnnals of Operations Research
P. Brucker, Bernd Jurisch, B. Sievers (1994)
A Branch and Bound Algorithm for the Job-Shop Scheduling ProblemDiscret. Appl. Math., 49
R. Haupt (1989)
A survey of priority rule-based schedulingOperations-Research-Spektrum, 11
E. Pesch (1994)
Learning in automated manufacturing
G. Deweß (1992)
An existence theorem for packing problems with implications for the computation of optimal machine schedulesOptimization, 25
(1996)
Wissensbasierte Methoden zur Optimierung von Produktionsabll aufen. Master's thesis
P. Baptiste, C. Pape (1996)
Edge-Finding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling
P. Baptiste, C. Pape (1995)
A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling
(1963)
Probabilistic learning combinations of local job shop scheduling rules
Vipin Kumar (1992)
Algorithms for Constraint-Satisfaction Problems: A SurveyAI Mag., 13
J. Carlier, E. Pinson (1989)
An algorithm for solving the job-shop problemManagement Science, 35
(1994)
Adjustments of heads and tails for the job shop problem
Wpm Nuijten (1994)
Time and resource constrained scheduling : a constraint satisfaction approach
D. Applegate, W. Cook (1991)
A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 3
U. Dorndorf, E. Pesch, T. Huy (2000)
Constraint propagation techniques for the disjunctive scheduling problemArtif. Intell., 122
J. Carlier (1982)
The one-machine sequencing problemEuropean Journal of Operational Research, 11
J. Błażewicz, W. Domschke, E. Pesch (1996)
The job shop scheduling problem: Conventional and new solution techniquesEuropean Journal of Operational Research, 93
U. Dorndorf, E. Pesch, T. Huy (2000)
A branch-and-bound algorithm for the resource-constrained project scheduling problemMathematical Methods of Operations Research, 52
U. Dorndorf, T. Phan-Huy, E. Pesch (1999)
Project Scheduling-Recent Models, Algorithms and Applications, Vol. 14
(1964)
Les probl emes d`ordonnancement avec contraintes disjonctives
Table 9: EG2: the average results for the 15 15 instance
M.R. Garey, D.S. Johnson (1979)
Computers and Intractability: A Guide to the Theory of NPCompleteness
Y. Caseau, F. Laburthe (1995)
Disjunctive Scheduling with Task Intervals
(1994)
A fast branch and bound algorithm for the job shop scheduling problem
U. Dorndorf, E. Pesch, Toàn Phan-Huy (2001)
Solving the open shop scheduling problemJournal of Scheduling, 4
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH Adjustment of heads and tails for the job-shop problem
(1963)
Industrial Scheduling
E. Tsang (1989)
Consistency and satisfiability in constraint satisfaction problems
T. Phan-Huy (1996)
Wissensbasierte Methoden zur Optimierung von Produktionsabläufen
David Johnson (1982)
The NP-Completeness Column: An Ongoing GuideJ. Algorithms, 4
E. Pesch, U. Tetzlaff (1996)
Constraint Propagation Based Scheduling of Job ShopsINFORMS J. Comput., 8
J. Carlier, E. Pinson (1991)
A Practical Use of Jackson''s Preemptive Schedule for Solving the Job-Shop Problem. Annals of Opera
(1984)
Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques
In recent years, constraint propagation techniques have been shown to be highly effective for solving difficult scheduling problems. In this paper, we present an algorithm which combines constraint propagation with a problem decomposition approach in order to simplify the solution of the job shop scheduling problem. This is mainly guided by the observation that constraint propagation is more effective for ‘small’ problem instances. Roughly speaking, the algorithm consists of deducing operation sequences that are likely to occur in an optimal solution of the job shop scheduling problem (JSP).
Annals of Operations Research – Springer Journals
Published: Oct 10, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.