{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T14:28:35Z","timestamp":1769264915905,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2005,6]]},"DOI":"10.1007\/s10951-005-6812-2","type":"journal-article","created":{"date-parts":[[2005,5,3]],"date-time":"2005-05-03T09:42:56Z","timestamp":1115113376000},"page":"211-231","source":"Crossref","is-referenced-by-count":47,"title":["New Single Machine and Job-Shop Scheduling Problems with Availability Constraints"],"prefix":"10.1007","volume":"8","author":[{"given":"Ph.","family":"Maugui\u00e8re","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.-C.","family":"Billaut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.-L.","family":"Bouquard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J. Adams","year":"1988","unstructured":"Adams, J., E. Balas, and D. Zawack, \u201cThe shifting bottleneck procedure for job shop scheduling,\u201d Management Science, 34(3):391\u2013401, 1988.","journal-title":"Management Science"},{"key":"CR2","unstructured":"R. Aggoune. Ordonnancement d\u2019ateliers sous contraintes de disponibilite des machines (in french). Phd thesis, Universite de Metz, Metz, France, december 2002."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1002\/nav.3800210112","volume":"21","author":"K. R. Baker","year":"1974","unstructured":"K. R. Baker and Z. S. Su. Sequencing with due-dates and early start times to minimize maximum tardiness. Naval Res. Logist. Quart., 21:171\u2013176, 1974.","journal-title":"Naval Res. Logist. Quart."},{"issue":"4","key":"CR4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1023\/A:1009750409895","volume":"l","author":"E. Balas","year":"1998","unstructured":"E. Balas, G. Lancia, P. Serafhi, and A. Vazacopoulos. Job shop scheduling with deadlines. Journal of Combinatorial Optimization, 1(4):329\u2013353, 1998.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"6","key":"CR5","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/S0305-0483(01)00048-2","volume":"29","author":"J. Blazewicz","year":"2001","unstructured":"J. Blazewicz, J. Breit, P. Formanowicz, W. Kubiak, and G. Schmidt. Heuristic algorithms for the two-machines fbwshop with limited machine availability. Omega, 29(6):599\u2013608, 2001.","journal-title":"Omega"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/1099-1425(200101\/02)4:1<53::AID-JOS59>3.0.CO;2-Y","volume":"4","author":"W. Brinkkotter","year":"2001","unstructured":"W. Brinkkotter and P. Brucker. Solving open benchmark instances for the job shop problem by parallel head-tail adjustments. Journal of Scheduling, 4:53\u201364, 2001.","journal-title":"Journal of Scheduling"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","volume":"49","author":"P. Brucker","year":"1994","unstructured":"P. Brucker, B. Jusrish, and B. Sievers. A fast branch and bound algorihtm for the job-shop scheduling problem. Discrete Applied Mathematics, 49:107\u2013127, 1994.","journal-title":"Discrete Applied Mathematics"},{"key":"CR8","unstructured":"C. Canon, J-C. Billaut, and J-L. Bouquard. The one-machine sequencing problem with availability constraints. Technical Report 271, Laboratoire d\u2019Informatique de FUniversite de Tours, Tours, France, August 2003."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J. Carlier","year":"1982","unstructured":"J. Carlier. The one-machine sequencing problem. European Journal of Operational Research, 11:42\u201347, 1982.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"CR10","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"J. Carlier and E. Pinson. An algorithm for solving the job-shop problem. Management Science, 35(2):164\u2013176, 1989.","journal-title":"Management Science"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","volume":"26","author":"J. Carlier","year":"1990","unstructured":"J. Carlier and E. Pinson. A practical use of Jackson\u2019s preemptive schedule for solving the job-shop problem. Annals of Operations Research, 26:269\u2013287, 1990.","journal-title":"Annals of Operations Research"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","volume":"78","author":"J. Carlier","year":"1994","unstructured":"J. Carlier and E. Pinson. Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research, 78:146\u2013161, 1994.","journal-title":"European Journal of Operational Research"},{"key":"CR13","volume-title":"Probabilistic learning Combinations of local job-shop scheduling rules","author":"H. Fischer","year":"1963","unstructured":"H. Fischer and L. Thompson. Probabilistic learning Combinations of local job-shop scheduling rules. Prentice Hall, Englewood Cliffs, New Jersey, 1963."},{"key":"CR14","volume-title":"Computers and Intractability : A Guide to the Theory of NP-Completness","author":"M. R. Carey","year":"1979","unstructured":"M. R. Carey and D. S. Johnson. Computers and Intractability : A Guide to the Theory of NP-Completness. W.H. Freeman and Co, San Francisco, California, 1979."},{"key":"CR15","first-page":"330","volume":"13","author":"M. R. Carey","year":"1976","unstructured":"M. R. Carey, D. S. Johnson, and R. Sethi. The complexity of fbwshop and jobshop scheduling. Mathematics of Operations Research, 13:330\u2013348, 1976.","journal-title":"Mathematics of Operations Research"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(86)90191-8","volume":"26","author":"J. Grabowski","year":"1986","unstructured":"J. Grabowski, E. Nowicki, and S. Zdrzalka. A block approach for single-machine scheduling with release dates and due dates. European Journal of Operational Research, 26:278\u2013285, 1986.","journal-title":"European Journal of Operational Research"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"4","author":"R. L. Graham","year":"1979","unstructured":"R. L. Graham, E. L. Lawler, and J. K. Lenstra A. H. G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling : A survey. Annals of Discrete Mathematics, 4:287\u2013326, 1979.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR18","volume-title":"Scheduling a production line to minimize maximum tardiness, research report 43, management science research report","author":"J. R. Jackson","year":"1955","unstructured":"J. R. Jackson. Scheduling a production line to minimize maximum tardiness, research report 43, management science research report. University of California, Los Angeles, 1955.Technical report,"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1111\/j.1467-9574.1976.tb00264.x","volume":"30","author":"B. J. Lageweg","year":"1976","unstructured":"B. J. Lageweg, J. K. Lenstra, and A. H. G. Rinnooy Kan. Minimizing maximum lateness on one machine : Computational experience and some applications. Statistica Neerlandica, 30:25\u201341, 1976.","journal-title":"Statistica Neerlandica"},{"issue":"4","key":"CR20","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1287\/mnsc.24.4.441","volume":"24","author":"B. J. Lageweg","year":"1977","unstructured":"B. J. Lageweg, J. K. Lenstra, and A. H. G. Rinnooy Kan. Job-shop scheduling by implicit enumeration. Management Science, 24(4):441\u2013450, 1977.","journal-title":"Management Science"},{"key":"CR21","unstructured":"S. Lawrence. Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Technical Report (http:\/\/mscmga.ms.ic.ac.uk\/info.html), Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania, 1984."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J. K. Lenstra","year":"1977","unstructured":"J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1:343\u2013362, 1977.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/1520-6750(199202)39:1<53::AID-NAV3220390105>3.0.CO;2-C","volume":"39","author":"V. J. Leon","year":"1992","unstructured":"V. J. Leon and S. D. Wu. On scheduling with ready-times, due-dates and vacations. Naval Research Logistics, 39:53\u201365, 1992.","journal-title":"Naval Research Logistics"},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"P. Martin and D. B. Shrnoys. A new approach to computing optimal schedules for the job-shop sheduling problem. In 5th International Conference on Integer Programming and Combinatorial Optimization (IPCO\u201996), pages 389\u2013403, Vancouver (Canada), 1996.","DOI":"10.1007\/3-540-61310-2_29"},{"key":"CR25","unstructured":"P. Mauguiere, J-C. Billaut, and J-L. Bouquard. Scheduling resumable and non-resumable operations. In Proceedings of the Joint International Meeting EURO\/INFORMS, pages 147\u2013148, Istanbul (Turkey), July, 2003."},{"key":"CR26","unstructured":"P. Mauguiere, J-L. Bouquard, and J-C. Billaut. A branch and bound algorithm for a job shop scheduling problem with availability constraints. In Proceedings of the Sixth Workshop on Models and Algorithms for Planning and Scheduling Problems, MAPSP\u20192003, pages 147\u2013148, Aussois (France), April, 2003."},{"issue":"3","key":"CR27","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1287\/opre.23.3.475","volume":"23","author":"G. McMahon","year":"1975","unstructured":"G. McMahon and M. Florian. On scheduling with ready times and due dates to minimize maximum lateness. Operations Research, 23(3):475\u2013482, 1975.","journal-title":"Operations Research"},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"L. Peridy and D. Rivreau. Local adjustments: A general algorithm. European Journal of Operational Research, to appear, 2004.","DOI":"10.1016\/j.ejor.2003.11.020"},{"key":"CR29","unstructured":"B. Roy and B. Sussmann. Les problemes d\u2019ordonnancement avec contraintes disjonctives (in French). Technical Report 9 bis, SEMA, Paris (France), December 1964."},{"key":"CR30","unstructured":"L. Schrage. Obtaining optimal solutions to resource constrained network scheduling problems (unpublished manuscript), 1971."},{"issue":"4","key":"CR31","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/ijoc.12.4.341.11881","volume":"12","author":"F. Sourd","year":"2000","unstructured":"F. Sourd and W. Nuijten. Multiple-machine lower bounds for shop scheduling problems. INFORMS Journal of Computing, 12(4):341\u2013352, 2000.","journal-title":"INFORMS Journal of Computing"},{"key":"CR32","unstructured":"A. Vazacopoulos. Difficult one-machine scheduling problems and a new longest tail heuristic. Phd thesis (chapter 5), 1994."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-005-6812-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-005-6812-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-005-6812-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T05:22:19Z","timestamp":1586236939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-005-6812-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["6812"],"URL":"https:\/\/doi.org\/10.1007\/s10951-005-6812-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}