Dedicated constraint propagation for Job-Shop problem with generic time-lags

IEEE International Conference on Emerging Technologies and Factory Automation, ETFA

Volumn , Issue , 2011, Pages

  Lacomme, P ^a   Tchernev, N ^a   Huguet, M J ^b  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

^b LAAS CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT PROPAGATION; EARLY DETECTION; FEASIBLE SOLUTION; JOB SHOP SCHEDULING PROBLEMS; JOB-SHOP; JOB-SHOP SCHEDULING; PROPAGATION RULE; STATE OF THE ART; TIME LAG;

FACTORY AUTOMATION; HEURISTIC METHODS;

SCHEDULING;

EID: 80655146409     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ETFA.2011.6059042     Document Type: Conference Paper

References (15)

1. C. Artigues, M. Huguet, and P. Lopez. Generalized disjunctive constraint propagation for solving the job shop problem with time lags. Engineering Applications of Artificial Intelligence, 24:220-231, 2011.
2. C. Bierwirth. A generalized permutation approach to jobshop scheduling with genetic algorithms. OR Spektrum, 17:87-92, 1995.
3. V. Botta-Genoulaz. Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness. International Journal of Production Economics, 64:101-111, 2000. (Pubitemid 30557647)
4. K. Brinkmann and K. Neumann. Heuristic procedures for resource-constrained project scheduling with minima1 and maxima1 time lags: the minimum project-duration and resource-leveling problems. Journal of Decision Systems, 5:129-156, 1996.
5. P. Brucker. Scheduling and constraint propagation. Discrete Applied Mathematics, 123:227-256, 2002.
6. P. Brucker, T. Hilbig, and J. Hurink. A branch and bound algorithm for a single machine scheduling with positive and negative time-lags. Discrete Applied Mathematics, 94:77-99, 1999. (Pubitemid 129550213)
7. A. Caumond, P. Lacomme, and N. Tchernev. A memetic algorithm for the job-shop with time-lags. Computers & Operations Research, 35:2331-2356, 2008. (Pubitemid 350161141)
8. J. Coelho and M. Vanhoucke. Multi-mode resourceconstrained project scheduling using rcpsp and sat solvers. European Journal of Operational Research, 213(7):73-83, 2011.
9. F. Deblaere, E. Demeulemeester, and W. Herroelen. Reactive scheduling in the multi-mode rcpsp. Computers & Operations Research, 38:63-74, 2011.
10. S. Demassey, C. Artigues, and P. Michelon. Constraint propagation based cutting planes: an application to the resource-constrained project scheduling problem. INFORMS Journal on Computing, 17:52-65, 2005. (Pubitemid 40308569)
11. F. Deppner. Ordonnancement d'atelier avec contraintes temporelles entre oprations. PhD thesis, Université de Nancy, LORIA, (France), 2004.
12. S. Hartmann and D. Briskorn. A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research, 207:1-14, 2010.
13. J. Hurink and J. Keuchel. Local search algorithms for a single-machine scheduling problem with positive and negative time-lags. Discrete Applied Mathematics, 112:179-197, 2001. (Pubitemid 33676140)
14. B. Roy and B. Sussmann. Ales problmes d'ordonnancement avec contraintes disjonctives. Technical report, Note DS n9 bis, SEMA, Paris, France, 1964.
15. E. D. Wikum, D. C. Llewellynn, and G. L. Nemhauser. One-machine generalized precedence constrained scheduling problem. Operations Research Letters, 16:87-99, 1994.