{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T21:16:24Z","timestamp":1775078184933,"version":"3.50.1"},"reference-count":45,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"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,2]]},"DOI":"10.1016\/s0377-2217(98)00367-1","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"1-15","source":"Crossref","is-referenced-by-count":398,"title":["Scheduling with limited machine availability"],"prefix":"10.1016","volume":"121","author":[{"given":"G\u00fcnter","family":"Schmidt","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00367-1_BIB1","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/BF00288977","article-title":"Single machine flow-time scheduling with a single breakdown","volume":"26","author":"Adiri","year":"1989","journal-title":"Acta Informatica"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB2","unstructured":"S. Albers, G. Schmidt, Scheduling with unexpected machine breakdowns, Technical Report MPI-I-98-1-021, Max Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, 1998"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB3","unstructured":"J. Blazewicz, J. Breit, P. Formanowicz, W. Kubiak, G. Schmidt, Heuristics for two machine flow shops with limited machine availability, Discussion Paper B-9802, Fachbereich Wirtschaftswissenschaft, University of Saarland, 1998"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB4","unstructured":"J. Blazewicz, M. Drozdowski, P. Formanowicz, W. Kubiak, G. Schmidt, Scheduling preemtable tasks on parallel processors with limited availability, unpublished"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB5","doi-asserted-by":"crossref","unstructured":"J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt, J. Weglarz, Scheduling Computer and Manufacturing Processes, Springer, Berlin, 1996","DOI":"10.1007\/978-3-662-03217-6"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB6","unstructured":"J. Blazewicz, P. Formanowicz, W. Kubiak, G. Schmidt, A note on a parallel branch and bound algorithm for the flow shop problem with limited machine availability, Working Paper, Poznan Supercomputing and Networking Center, Poznan, 1997"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(94)00110-3","article-title":"A lower bound for randomized on-line scheduling algorithms","volume":"51","author":"Chen","year":"1994","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB8","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0214047","article-title":"Scheduling flat graphs","volume":"14","author":"Dolev","year":"1985","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB9","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1137\/0606066","article-title":"Profile scheduling of opposing forests and level orders","volume":"6","author":"Dolev","year":"1985","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB10","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, San Francisco, 1979"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/nav.3800210113","article-title":"Some simple scheduling algorithms","volume":"21","author":"Horn","year":"1974","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production schedules with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB14","doi-asserted-by":"crossref","unstructured":"B. Kalyanasundaram, K.P. Pruhs, Fault-tolerant scheduling, in: Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, 1994, pp. 115\u2013124","DOI":"10.1145\/195058.195115"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB15","doi-asserted-by":"crossref","unstructured":"B. Kalyanasundaram, K.P. Pruhs, Fault-tolerant real-time scheduling, in: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA), Springer Lecture Notes in Computer Science, 1997","DOI":"10.1007\/3-540-63397-9_23"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB16","doi-asserted-by":"crossref","unstructured":"R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Communications, Plenum Press, New York, 1972, pp. 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB17","unstructured":"M. Kaspi, B. Montreuil, On the scheduling of identical parallel processes with arbitrary initial processor available time, Research Report 88-12, School of Industrial Engineering, Purdue University, West Lafayette, IN, 1988"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB18","doi-asserted-by":"crossref","unstructured":"H. Kellerer, Algorithms for multiprocessor scheduling with machine release time, IIE Transactions (to appear)","DOI":"10.1080\/07408179808966555"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB19","unstructured":"W. Kubiak, J. Blazewicz, P. Formanowicz, G. Schmidt, A branch and bound algorithm for two machine flow shops with limited machine availability, Research Report RA-001\/97, Poznan University of Technology, Institute of Computing Science, Poznan, 1997"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB20","unstructured":"J. Labetoulle, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Preemptive scheduling of uniform machines subject to due dates, Technical Paper BW 99\/79, CWI, Amsterdam, 1979"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB21","doi-asserted-by":"crossref","unstructured":"E.L. Lawler, Preemptive scheduling of precedence constrained jobs on parallel machines, in: Dempster et al. (Eds.), Deterministic and Stochastic Scheduling, Reidel, Boston, 1982, pp. 101\u2013123","DOI":"10.1007\/978-94-009-7801-0_6"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB22","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1287\/opre.37.2.314","article-title":"Preemptive scheduling of two uniform machines to minimize the number of late jobs","volume":"37","author":"Lawler","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB23","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0166-218X(91)90013-M","article-title":"Parallel machine scheduling with non-simultaneous machine available time","volume":"30","author":"Lee","year":"1991","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB24","first-page":"363","article-title":"Machine scheduling with an availability constraint, Journal of Global Optimization","volume":"9","author":"Lee","year":"1996","journal-title":"Special Issue on Optimization of Scheduling Applications"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB25","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0167-6377(96)00041-7","article-title":"Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint","volume":"20","author":"Lee","year":"1997","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB26","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF01178778","article-title":"Single machine flow-time scheduling with scheduled maintenance","volume":"29","author":"Lee","year":"1992","journal-title":"Acta Informatica"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB27","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0166-218X(90)90055-H","article-title":"Capacitated two-parallel machine scheduling to minimize sum of job completion times","volume":"41","author":"Lee","year":"1993","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1018909801944","article-title":"Current trends in deterministic scheduling","volume":"70","author":"Lee","year":"1997","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB29","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of processor scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Annals Discrete Mathematics"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB30","unstructured":"S. Liman, Scheduling with capacities and due-dates, Ph.D. Thesis, University of Florida, Gainesville, FL, 1991"},{"issue":"1","key":"10.1016\/S0377-2217(98)00367-1_BIB31","first-page":"109","article-title":"Exact bounds of the modified LPT algorithm applying to parallel machines scheduling with nonsimultaneous machine available times","volume":"B 12","author":"Lin","year":"1997","journal-title":"Applied Mathematics Journal of the Chinese University"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB32","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0166-218X(93)E0151-N","article-title":"Preemptive scheduling with variable profile, precedence constraints and due dates","volume":"58","author":"Liu","year":"1995","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB33","unstructured":"Z. Liu, E. Sanlaville, Profile scheduling of list algorithms, in: P. Chretienne et al. (Eds.), Scheduling Theory and its Applications, Wiley, New York, 1995, pp. 91\u2013110"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB34","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1137\/S0097539791218949","article-title":"Stochastic scheduling with variable profile and precedence constraints","volume":"26","author":"Liu","year":"1997","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB35","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/321574.321586","article-title":"Preemptive scheduling of real-time tasks on multiprocessor systems","volume":"17","author":"Muntz","year":"1970","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","article-title":"Scheduling with deadlines and loss functions","volume":"6","author":"McNaughton","year":"1959","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB37","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","article-title":"An n job one machine sequencing algorithm for minimizing the number of late jobs","volume":"15","author":"Moore","year":"1968","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB38","unstructured":"T.E. Morton, D.W. Pentico, Heuristic Scheduling Systems, Wiley, New York, 1993"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB39","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0895-7177(94)90024-8","article-title":"Minimizing the sum of job completion times on capacitated parallel machines","volume":"20","author":"Mosheiov","year":"1994","journal-title":"Mathematical Computing and Modelling"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB40","doi-asserted-by":"crossref","unstructured":"E. Sanlaville, Nearly on line scheduling of preemptive independent tasks, Discrete Applied Mathematics 57, 229\u2013241","DOI":"10.1016\/0166-218X(94)00105-M"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB41","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01920917","article-title":"Scheduling on semi-identical processors","volume":"A 28","author":"Schmidt","year":"1984","journal-title":"Zeitschrift fur Operations Research"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB42","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1057\/jors.1988.44","article-title":"Scheduling independent tasks with deadlines on semi-identical processors","volume":"39","author":"Schmidt","year":"1988","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB43","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Communications of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB44","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single-stage production","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(98)00367-1_BIB45","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","article-title":"NP-complete scheduling problems","volume":"10","author":"Ullman","year":"1975","journal-title":"Journal of Computer and System Sciences"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798003671?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798003671?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T13:22:14Z","timestamp":1556112134000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798003671"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0377221798003671"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00367-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}