{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:45:25Z","timestamp":1743111925871,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020254"},{"type":"electronic","value":"9783642020261"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02026-1_41","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T16:31:23Z","timestamp":1245256283000},"page":"430-437","source":"Crossref","is-referenced-by-count":0,"title":["Makespan Minimization with Machine Availability Constraints"],"prefix":"10.1007","author":[{"given":"Bin","family":"Fu","sequence":"first","affiliation":[]},{"given":"Yumei","family":"Huo","sequence":"additional","affiliation":[]},{"given":"Hairong","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"41_CR1","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1016\/S0167-8191(00)00035-1","volume":"26","author":"J. Baewicz","year":"2000","unstructured":"Baewicz, J., Drozdowski, M., Formanowicz, P., Kubiak, W., Schmidt, G.: Scheduling Preemptable Tasks on Parallel Processors with Limited Availability. Parallel Computing\u00a026(9), 1195\u20131211 (2000)","journal-title":"Parallel Computing"},{"key":"41_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s001860200267","volume":"57","author":"J. Breit","year":"2003","unstructured":"Breit, J., Schmidt, G., Strusevich, V.A.: Non-Preemptive Two-Machine Open Shop Scheduling with Non-Availability Constraints. Mathematical Methods of Operations Research\u00a057, 217\u2013234 (2003)","journal-title":"Mathematical Methods of Operations Research"},{"issue":"3-4","key":"41_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0020-0190(00)00010-7","volume":"73","author":"A. Caprara","year":"2000","unstructured":"Caprara, A., Kellerer, H., Pferschy, U.: A PTAS for the Multiple Subset Sum Problem with Different Knapsack Capacities. Information Processing Letter\u00a073(3-4), 111\u2013118 (2000)","journal-title":"Information Processing Letter"},{"key":"41_CR4","first-page":"21","volume-title":"Handbook of Combinatorial Optimization","author":"B. Chen","year":"1998","unstructured":"Chen, B., Potts, C., Woeginger, G.: A Review of Machine Scheduling: Complexity, Algorithms and Approximability. In: Du, D.Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, pp. 21\u2013169. Kluwer, Boston (1998)"},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-77220-0_29","volume-title":"High Performance Computing \u2013 HiPC 2007","author":"F. Diedrich","year":"2007","unstructured":"Diedrich, F., Jansen, K., Pascual, F., Trystram, D.: Approximation Algorithms for Scheduling with Reservations. In: Aluru, S., Parashar, M., Badrinath, R., Prasanna, V.K. (eds.) HiPC 2007. LNCS, vol.\u00a04873, pp. 297\u2013307. Springer, Heidelberg (2007)"},{"key":"41_CR6","unstructured":"Fu, B., Huo, Y., Zhao, H.: Exponential Inapproximability and FPTAS for Scheduling with Availability Constraints. Theoretical Computer Science (to appear)"},{"key":"41_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, CA (1979)"},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using Dual Approximation Algorithms for Scheduling Problems: Practical and Theoretical Results. Journal of ACM\u00a034, 144\u2013162 (1987)","journal-title":"Journal of ACM"},{"issue":"1","key":"41_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.dam.2004.12.002","volume":"148","author":"H.-C. Hwang","year":"2005","unstructured":"Hwang, H.-C., Lee, K., Chang, S.Y.: The Effect of Machine Availability on the Worst-Case Performance of LPT. Disc. App. Math.\u00a0148(1), 49\u201361 (2005)","journal-title":"Disc. App. Math."},{"key":"41_CR10","first-page":"991","volume":"30","author":"H. Kellerer","year":"1998","unstructured":"Kellerer, H.: Algorithm for Multiprocessor Scheduling with Machine Release Time. IIE Transactions\u00a030, 991\u2013999 (1998)","journal-title":"IIE Transactions"},{"key":"41_CR11","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/S0377-2217(01)00083-2","volume":"136","author":"W. Kubiak","year":"2002","unstructured":"Kubiak, W., Blazewic, J., Formanowicz, P., Breit, J., Schmidt, G.: Two-machine Flow Shops with Limited Machine Availability. European Journal of Operational Research\u00a0136, 528\u2013540 (2002)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"41_CR12","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.cor.2007.10.013","volume":"36","author":"M.A. Kubzin","year":"2009","unstructured":"Kubzin, M.A., Potts, C.N., Strusevich, V.A.: Approximation Results for Flow Shop Scheduling Problems with Machine Availability Constraints. Computers & Operations Research\u00a036(2), 379\u2013390 (2009)","journal-title":"Computers & Operations Research"},{"key":"41_CR13","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00121681","volume":"9","author":"C.Y. Lee","year":"1996","unstructured":"Lee, C.Y.: Machine Scheduling with Availability Constraint. Journal of Global Optimization\u00a09, 395\u2013416 (1996)","journal-title":"Journal of Global Optimization"},{"key":"41_CR14","first-page":"22","volume-title":"Handboof of Scheduing","author":"C.Y. Lee","year":"2004","unstructured":"Lee, C.Y.: Machine Scheduling with Availability Constraints. In: Leung, J.Y.-T. (ed.) Handboof of Scheduing, pp. 22.1\u201322.13. CRC Press, Boca Raton (2004)"},{"key":"41_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0166-218X(91)90013-M","volume":"30","author":"C.-Y. Lee","year":"1991","unstructured":"Lee, C.-Y.: Parallel Machines Scheduling with Non-Simultaneous Machine Available Time. Discrete Applied Mathematics\u00a030, 53\u201361 (1991)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"41_CR16","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.ejor.2006.11.027","volume":"184","author":"L.-W. Liao","year":"2008","unstructured":"Liao, L.-W., Sheen, G.-J.: Parallel Machine Scheduling with Machine Availability and Eligibility Constraints. European Journal of Operational Research\u00a0184(2), 458\u2013467 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"41_CR17","first-page":"360","volume":"1","author":"H. Saidy","year":"2008","unstructured":"Saidy, H., Taghvi-Fard, M.: Study of Scheduling Problems with Machine Availability Constraint. Journal of Industrial and Systems Engineering\u00a01(4), 360\u2013383 (2008)","journal-title":"Journal of Industrial and Systems Engineering"},{"key":"41_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<267::AID-JOS31>3.0.CO;2-H","volume":"2","author":"M. Scharbrodt","year":"1999","unstructured":"Scharbrodt, M., Steger, A., Weisser, H.: Approximation of Scheduling with Fixed Jobs. Journal of Scheduling\u00a02, 267\u2013284 (1999)","journal-title":"Journal of Scheduling"},{"key":"41_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","volume":"121","author":"G. Schmidt","year":"2000","unstructured":"Schmidt, G.: Scheduling with Limited Machine Availability. European Journal of Operational Research\u00a0121, 1\u201315 (2000)","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"41_CR20","doi-asserted-by":"publisher","first-page":"2266","DOI":"10.1016\/j.cor.2005.09.002","volume":"34","author":"G.-J. Sheen","year":"2007","unstructured":"Sheen, G.-J., Liao, L.-W.: Scheduling Machine-Dependent Jobs to Minimize Lateness on Machines with Identical Speed under Availability Constraints. Computers & Operations Research\u00a034(8), 2266\u20132278 (2007)","journal-title":"Computers & Operations Research"},{"issue":"10-12","key":"41_CR21","doi-asserted-by":"publisher","first-page":"1629","DOI":"10.1016\/j.camwa.2005.07.008","volume":"50","author":"J. Xie","year":"2005","unstructured":"Xie, J., Wang, X.: Complexity and Algorithms for Two-Stage Flexible Flowshop Scheduling with Availability Constraints. Computers & Mathematics with Applications\u00a050(10-12), 1629\u20131638 (2005)","journal-title":"Computers & Mathematics with Applications"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02026-1_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:52:51Z","timestamp":1714621971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02026-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020254","9783642020261"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02026-1_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}