{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T07:51:12Z","timestamp":1770969072398,"version":"3.50.1"},"reference-count":36,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4794,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0166-218x(99)00206-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:02:29Z","timestamp":1027648949000},"page":"223-243","source":"Crossref","is-referenced-by-count":107,"title":["Parallel machine scheduling with a common server"],"prefix":"10.1016","volume":"102","author":[{"given":"Nicholas G.","family":"Hall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris N.","family":"Potts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chelliah","family":"Sriskandarajah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00206-1_BIB1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0272-6963(84)90030-5","article-title":"Two heuristics for the deterministic, single operator, multiple machine, multiple run cyclic scheduling problem","volume":"4","author":"Aronson","year":"1984","journal-title":"J. Oper. Management"},{"key":"10.1016\/S0166-218X(99)00206-1_BIB2","unstructured":"K.R. Baker, Introduction to Sequencing and Scheduling, Wiley, New York, 1974."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB3","unstructured":"R.W. Conway, W.L. Maxwell, L.W. Miller, Theory of Scheduling, Addison-Wesley, Reading, MA, 1967."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB4","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","article-title":"Minimizing total tardiness on one machine is NP-hard","volume":"15","author":"Du","year":"1990","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB5","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1287\/opre.17.4.701","article-title":"One-machine sequencing to minimize certain functions of job tardiness","volume":"17","author":"Emmons","year":"1969","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1018936219150","article-title":"Design and operational issues in AGV-served manufacturing systems","volume":"76","author":"Ganesharajah","year":"1998","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB7","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman & Company, San Francisco, 1979."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB8","unstructured":"C.A. Glass, Y.M. Shafransky, V.A. Strusevich, Scheduling for parallel dedicated machines with a single server, Working Paper OR86, Faculty of Mathematical Studies, University of Southampton, UK, 1996."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic machine scheduling: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB10","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1287\/opre.45.3.421","article-title":"Scheduling in robotic cells: classification, two and three machine cells","volume":"45","author":"Hall","year":"1997","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0377-2217(96)00333-5","article-title":"Scheduling in robotic cells: complexity and steady state analysis","volume":"109","author":"Hall","year":"1998","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB12","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","article-title":"A survey of machine scheduling problems with blocking and no-wait in process","volume":"44","author":"Hall","year":"1996","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB13","unstructured":"J. Hartley, Robots at Work, North-Holland, Amsterdam, 1983."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB14","unstructured":"G.M. Hull, Case study of the design and installation of a robot-loaded machining cell, Proceedings of the Fourth International Conference on Flexible Manufacturing Systems, 1985."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB15","unstructured":"H. Inaba, S. Sakakibara, Flexible automation \u2014 unmanned machining and assembly cells with robots, Proceedings of the First International Conference on Flexible Manufacturing Systems, 1982."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB16","unstructured":"J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Management Science Research Project, University of California, Los Angeles, CA, 1955."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB17","doi-asserted-by":"crossref","unstructured":"H. Kamoun, N.G. Hall, C. Sriskandarajah, Scheduling in robotic cells: heuristics and cell design, Oper. Res., 1999, to appear.","DOI":"10.1287\/opre.47.6.821"},{"key":"10.1016\/S0166-218X(99)00206-1_BIB18","doi-asserted-by":"crossref","unstructured":"R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85\u2013103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10.1016\/S0166-218X(99)00206-1_BIB19","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1016\/0305-0548(96)00011-1","article-title":"Scheduling two parallel semiautomatic machines to minimize machine interference","volume":"23","author":"Koulamas","year":"1996","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB20","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.1080\/00207548808947963","article-title":"Look-ahead scheduling for minimizing machine interference","volume":"26","author":"Koulamas","year":"1988","journal-title":"Internat. J. Production Res."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0895-7177(97)00236-7","article-title":"Parallel machine scheduling problems with a single server","volume":"26","author":"Kravchenko","year":"1997","journal-title":"Math. Comput. Modelling"},{"key":"10.1016\/S0166-218X(99)00206-1_BIB22","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1287\/mnsc.11.2.280","article-title":"On scheduling problems with deferral costs","volume":"11","author":"Lawler","year":"1964","journal-title":"Management Sci."},{"issue":"5","key":"10.1016\/S0166-218X(99)00206-1_BIB23","first-page":"27","article-title":"Sequencing to minimize the weighted number of tardy jobs","volume":"S10","author":"Lawler","year":"1976","journal-title":"RAIRO Recherche Op\u00e9rationnelle"},{"key":"10.1016\/S0166-218X(99)00206-1_BIB24","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","article-title":"A \u201cpseudopolynomial\u201d algorithm for sequencing jobs to minimize total tardiness","volume":"1","author":"Lawler","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB25","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","article-title":"J.M. Moore, A functional equation and its application to resource allocation and sequencing problems","volume":"16","author":"Lawler","year":"1969","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB26","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0166-218X(99)00206-1_BIB27","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1080\/05695557408974940","article-title":"Heuristic methods for assigning men to machines: an experimental analysis","volume":"6","author":"Miller","year":"1974","journal-title":"AIIE Trans."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB28","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1111\/j.1540-5915.1977.tb01067.x","article-title":"The assignment of men to machines: an application of branch and bound","volume":"8","author":"Miller","year":"1977","journal-title":"Decision Sci."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB29","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1287\/opre.30.1.116","article-title":"Linear-time algorithms for scheduling on parallel processors","volume":"30","author":"Monma","year":"1982","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB30","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 Sci."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB31","unstructured":"C.H. Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB32","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01324886","article-title":"Sequencing of parts and robot moves in a robotic cell","volume":"4","author":"Sethi","year":"1992","journal-title":"Internat. J. Flexible Manufacturing Systems"},{"key":"10.1016\/S0166-218X(99)00206-1_BIB33","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 Res. Logistics Quart."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB34","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1018952722784","article-title":"Scheduling large robotic cells without buffers","volume":"76","author":"Sriskandarajah","year":"1998","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB35","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/00207548508904696","article-title":"Review of operator\/machine interference models","volume":"23","author":"Stecke","year":"1985","journal-title":"Internat. J. Production Res."},{"key":"10.1016\/S0166-218X(99)00206-1_BIB36","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1080\/00207548508904690","article-title":"A structure for sequencing robot activities in machine loading applications","volume":"23","author":"Wilhelm","year":"1985","journal-title":"Internat. J. Production Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99002061?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99002061?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T03:56:22Z","timestamp":1555300582000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99002061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0166218X99002061"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00206-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}