{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:05:51Z","timestamp":1761620751771},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1016\/s0377-2217(99)00497-x","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"332-343","source":"Crossref","is-referenced-by-count":26,"title":["On Not-First\/Not-Last conditions in disjunctive scheduling"],"prefix":"10.1016","volume":"127","author":[{"given":"Philippe","family":"Torres","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Lopez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0377-2217(99)00497-X_BIB1","first-page":"149","article-title":"A computational study of the job-shop scheduling problem, ORSA","volume":"3","author":"Applegate","year":"1991","journal-title":"Journal of Computing"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB2","unstructured":"P. Baptiste, C. Le Pape, A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling, in: Proceedings of the 14th IJCAI, Montreal, Canada, 1995"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB3","unstructured":"P. Baptiste, C. Le Pape, Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling, in: Proceedings of the UK planning and scheduling meeting, Liverpool, November 1996"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB4","doi-asserted-by":"crossref","unstructured":"P. Baptiste, C. Le Pape, Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems, in: Proceedings of the Third International Conference on Principles and Practice of Constraint Programming, Schloss Hagenberg, Austria, 1997","DOI":"10.1007\/BFb0017454"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB5","unstructured":"P. Baptiste, C. Le Pape, W.P.M. Nuijten, Constraint-based optimisation and approximation for job-shop scheduling, in: Proceedings of the 14th IJCAI, Montreal, Canada, 1995"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB6","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(97)00335-4","article-title":"A branch and bound algorithm for the resource-constrained projectscheduling problem","volume":"107","author":"Brucker","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB7","unstructured":"J. Carlier, Ordonnancement \u00e0 contraintes disjonctives, Th\u00e8se de Troisi\u00e8me Cycle, Universit\u00e9 Paris VI, 1975"},{"issue":"2","key":"10.1016\/S0377-2217(99)00497-X_BIB8","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the job-shop problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","article-title":"A practical use of Jackson's preemptive schedule for solving the job-shop problem","volume":"26","author":"Carlier","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB10","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","article-title":"Adjustment of heads and tails for the job-shop problem","volume":"78","author":"Carlier","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB11","doi-asserted-by":"crossref","unstructured":"Y. Caseau, F. Laburthe, Improving branch and bound for jobshop scheduling with constraint propagation, in: Proceedings of the Eighth Franco-Japanese\u20134th Franco-Chinese Conference on Combinatorics and Computer Science Brest, France, July 1995","DOI":"10.1007\/3-540-61576-8_79"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB12","unstructured":"Y. Caseau, F. Laburthe, Effective Forget-and-Extend heuristics for scheduling problems, in: Proceedings of the Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems, Ferrara, Italy, 1999"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB13","doi-asserted-by":"crossref","unstructured":"J. Erschler, P. Esquirol, Decision-aid in job shop scheduling: a knowledge based approach, in: Proceedings of the IEEE International Conference on Robotics and Automation, San Francisco, CA, 1986, pp. 1651\u20131656","DOI":"10.1109\/ROBOT.1986.1087442"},{"issue":"4","key":"10.1016\/S0377-2217(99)00497-X_BIB14","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1287\/opre.24.4.774","article-title":"Finding some essential characteristics of the feasible solutions for ascheduling problem","volume":"24","author":"Erschler","year":"1976","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/S0377-2217(99)00497-X_BIB15","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0377-2217(80)90005-3","article-title":"Characterizing the set of feasible sequences for n jobs to be carried out on a single machine","volume":"4","author":"Erschler","year":"1980","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB16","unstructured":"S.A. Grant, B.M. Smith, The phase transition behaviour of maintaining arc-consistency, 95.25, Division of Artificial Intelligence, University of Leeds, England, August 1995"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB17","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","article-title":"Deterministic job-shop scheduling: Past, present and future","volume":"113","author":"Jain","year":"1999","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0377-2217(99)00497-X_BIB18","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1051\/ro:1999109","article-title":"D\u00e9composition temporelle et caract\u00e9risation de solutions admissibles pour le probl\u00e8me d'ordonnancement \u00e0 une machine","volume":"33","author":"Levy","year":"1999","journal-title":"RAIRO-Recherche Op\u00e9rationnelle\/Operations Research"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB19","unstructured":"P. Lopez, Approche \u00e9nerg\u00e9tique pour l'ordonnancement de t\u00e2ches sous contraintes de temps et de ressources, Th\u00e8se de Doctorat, Universit\u00e9 Paul Sabatier, Toulouse, 1991"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB20","unstructured":"P. Lopez, P. Esquirol, Consistency enforcing in scheduling: a general formulation based on energetic reasoning, in: Proceedings of the Fifth International Workshop on Project Management and Scheduling, Poznan, Poland, 1996, pp. 155\u2013158"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB21","doi-asserted-by":"crossref","unstructured":"P. Martin, D.B. Schmoys, A new approach to computing optimal schedules for the job-shop scheduling problem, in: Proceedings of the Fifth Conference on Integer Programming and Combinatorial Optimization, 1996","DOI":"10.1007\/3-540-61310-2_29"},{"issue":"6","key":"10.1016\/S0377-2217(99)00497-X_BIB22","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","article-title":"A fast taboo search algorithm for the job-shop problem","volume":"42","author":"Nowicki","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB23","unstructured":"W.P.M. Nuijten, Time and resource constrained scheduling: a constraint satisfaction approach, Ph.D. Thesis, Eindhoven University of Technology, 1994"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB24","unstructured":"W.P.M. Nuijten, E.H.L. Aarts, A computational study of constraint satisfaction for multiple capacitated job-shop scheduling, in: Proceedings of the Fourth International Workshop on Project Management and Scheduling, Leuven, Belgium, 1994, pp. 166\u2013173"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB25","unstructured":"S. Smith, C. Cheng, Slack-based heuristics for constraint satisfaction scheduling, in: Proceedings of the AAAI-93, Washington, DC, 1993, pp. 139\u2013144"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB26","series-title":"Foundations of Constraint Satisfaction","author":"Tsang","year":"1993"},{"key":"10.1016\/S0377-2217(99)00497-X_BIB27","unstructured":"P. van Hentenryck, Constraint Satisfaction in Logic Programming, Logic Programming Series, MIT Press, Cambridge, MA, 1989"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179900497X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179900497X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T05:45:35Z","timestamp":1578548735000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722179900497X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["S037722179900497X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00497-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}