{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T15:54:32Z","timestamp":1779897272261,"version":"3.53.1"},"reference-count":83,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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,1]]},"DOI":"10.1016\/s0377-2217(99)00153-8","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"228-249","source":"Crossref","is-referenced-by-count":766,"title":["Scheduling with batching: A review"],"prefix":"10.1016","volume":"120","author":[{"given":"Chris N.","family":"Potts","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikhail Y.","family":"Kovalyov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00153-8_BIB1","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1287\/opre.40.4.750","article-title":"Batching and scheduling jobs on batch and discrete processors","volume":"39","author":"Ahmadi","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0305-0548(90)90003-P","article-title":"Single facility multi-class job scheduling","volume":"17","author":"Ahn","year":"1990","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(93)90085-3","article-title":"The complexity of one-machine batching problems","volume":"47","author":"Albers","year":"1993","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB4","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1080\/07408178808966147","article-title":"Scheduling the production of components at a common facility","volume":"20","author":"Baker","year":"1988","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","article-title":"Scheduling a batching machine","volume":"1","author":"Brucker","year":"1998","journal-title":"Journal of Scheduling"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01303431","article-title":"Single machine batch scheduling to minimize the weighted number of late jobs","volume":"43","author":"Brucker","year":"1996","journal-title":"Mathematical Methods of Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1018912114491","article-title":"Batch scheduling with deadlines on parallel machines","volume":"83","author":"Brucker","year":"1998","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB8","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/0207031","article-title":"Complexity of task sequencing with deadlines, set-up times and changeover costs","volume":"7","author":"Bruno","year":"1978","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(93)90030-K","article-title":"Minimizing total completion time on a batch processing machine with job families","volume":"13","author":"Chandru","year":"1993","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB10","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1137\/0222078","article-title":"A better heuristic for preemptive parallel machine scheduling with batch setup times","volume":"22","author":"Chen","year":"1993","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01585875","article-title":"Approximation algorithms for two-machine flow shop scheduling with batch setup times","volume":"82","author":"Chen","year":"1998","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB12","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1287\/opre.42.6.1171","article-title":"Parallel machine scheduling with batch setup times","volume":"42","author":"Cheng","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB13","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1080\/15458830.1996.11770748","article-title":"Parallel-machine batching and scheduling to minimize total completion time","volume":"28","author":"Cheng","year":"1996","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB14","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/0305-0548(94)90001-9","article-title":"One-machine batching and sequencing of multiple-type items","volume":"21","author":"Cheng","year":"1994","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB15","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0377-2217(96)00127-0","article-title":"Single machine scheduling with batch deliveries","volume":"94","author":"Cheng","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(96)80468-9","article-title":"Batch scheduling and common due date assignment on a single machine","volume":"70","author":"Cheng","year":"1996","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB17","unstructured":"T.C.E. Cheng, M.Y. Kovalyov, Single machine batch scheduling with sequential job processing, in submission"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB18","unstructured":"T.C.E. Cheng, M.Y. Kovalyov, Algorithms for parallel machine batch scheduling with deadlines, in submission"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB19","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1137\/S1052623494269540","article-title":"Single machine scheduling to minimize batch delivery and job earliness penalties","volume":"7","author":"Cheng","year":"1997","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB20","unstructured":"T.C.E. Cheng, A. Toker, B.M.T. Lin, Makespan minimization in the two-machine flow-shop batch scheduling problem, Working paper 04\/95-6, The Hong Kong Polytechnic University, Faculty of Business and Information Systems, 1995"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB21","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1080\/07408179808966485","article-title":"Batching and scheduling to minimize the makespan in the two-machine flowshop","volume":"30","author":"Cheng","year":"1998","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB22","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/opre.37.3.426","article-title":"Optimal scheduling of products with two subassemblies on a single machine","volume":"37","author":"Coffman","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB23","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF02248589","article-title":"Batch sizing and job sequencing on a single machine","volume":"26","author":"Coffman","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB24","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1018920416308","article-title":"Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time","volume":"83","author":"Crauwels","year":"1998","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB25","unstructured":"H.A.J. Crauwels, C.N. Potts, D. Van Oudheusden, L.N. Van Wassenhove, Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs, Report, Faculty of Mathematical Studies, University of Southampton, UK, 1999"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB26","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0377-2217(95)00349-5","article-title":"Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs","volume":"90","author":"Crauwels","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB27","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/A:1018978322417","article-title":"Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time","volume":"70","author":"Crauwels","year":"1997","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB28","unstructured":"D. Dannenberg, T. Tautenhahn, F. Werner, A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size, Preprint No. 52, Fakult\u00e4t f\u00fcr Mathematik, Otto-von-Guericke-Universit\u00e4t Magdeburg, Germany, 1997"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB29","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1287\/mnsc.33.6.784","article-title":"Batching to minimize flow times on one machine","volume":"33","author":"Dobson","year":"1987","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB30","unstructured":"M. Fazle Baki, R.G. Vickson, One-operator, two-machine scheduling with setup times for machines and maximum lateness objective, Technical paper 205-MS, Department of Management Sciences, University of Waterloo, Canada, 1997"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB31","unstructured":"A.E. Gerodimos, Private communication, 1998"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB32","doi-asserted-by":"crossref","unstructured":"A.E. Gerodimos, C.A. Glass, C.N. Potts, Scheduling the production of two-component jobs on a single machine, European Journal of Operational Research, in press","DOI":"10.1016\/S0377-2217(99)00154-X"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB33","unstructured":"A.E. Gerodimos, C.A. Glass, C.N. Potts, Scheduling customised jobs on a single machine under item availability, Report OR88, Faculty of Mathematical Studies, University of Southampton, UK, 1997"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB34","unstructured":"A.E. Gerodimos, C.A. Glass, C.N. Potts, T. Tautenhahn, Scheduling multi-operation jobs on a single machine, Annals of Operations Research, in press"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB35","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0167-6377(94)90040-X","article-title":"Batch scheduling to minimize total completion time","volume":"16","author":"Ghosh","year":"1994","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB36","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0167-6377(97)00028-X","article-title":"Batch scheduling to minimize maximum lateness","volume":"21","author":"Ghosh","year":"1997","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB37","unstructured":"C.A. Glass, C.N. Potts, V.A. Strusevich, Scheduling batches with sequential job processing for two-machine flow and open shops, Report, Faculty of Mathematical Studies, University of Southampton, UK, 1998"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB38","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":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB39","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0377-2217(88)90252-4","article-title":"Single facility scheduling with multiple job classes","volume":"33","author":"Gupta","year":"1988","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB40","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1023\/A:1018903027868","article-title":"Single machine scheduling with batch set-up times to minimize maximum lateness","volume":"70","author":"Hariri","year":"1997","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB41","doi-asserted-by":"crossref","unstructured":"R. Hassin, Private communication, 1996","DOI":"10.1287\/mnsc.42.4.618"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB42","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1287\/ijoc.7.4.443","article-title":"Solving a class scheduling problem with a genetic algorithm","volume":"7","author":"Herrmann","year":"1995","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB43","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0167-6377(94)90063-9","article-title":"Scheduling with batching: Minimizing the weighted number of tardy jobs","volume":"16","author":"Hochbaum","year":"1994","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB44","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1287\/opre.45.6.874","article-title":"Scheduling semiconductor burn-in operations to minimize total flowtime","volume":"45","author":"Hochbaum","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB45","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF01585876","article-title":"Scheduling by positional completion times: Analysis of a two-stage flow shop with a batching machine","volume":"82","author":"Hoogeveen","year":"1998","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB46","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/(SICI)1099-1425(1998100)1:3<127::AID-JOS11>3.0.CO;2-9","article-title":"A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbor","volume":"1","author":"Hurink","year":"1998","journal-title":"Journal of Scheduling"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB47","unstructured":"J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Research report 43, Management Science Research Project, University of California, Los Angeles, CA, 1955"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB48","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(99)00153-8_BIB49","first-page":"177","article-title":"Scheduling customer orders: An alternative production scheduling approach","volume":"3","author":"Julien","year":"1990","journal-title":"Journal of Manufacturing and Operations Management"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB50","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0895-7177(93)90196-6","article-title":"Two-machine shop scheduling problems with batch processing","volume":"17","author":"Kleinau","year":"1993","journal-title":"Mathematical and Computer Modelling"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB51","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0166-218X(97)00092-9","article-title":"Batch scheduling and common due date assignment problem: An NP-hard case","volume":"80","author":"Kovalyov","year":"1997","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB52","doi-asserted-by":"crossref","unstructured":"M.Y. Kovalyov, C.N. Potts, L.N. Van Wassenhove, Single machine scheduling with set-ups to minimize the number of late items, Report, Econometric Institute, Erasmus University Rotterdam, Rotterdam, The Netherlands, 1992","DOI":"10.1016\/0167-6377(92)90001-J"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB53","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0020-0190(97)00154-3","article-title":"Batch scheduling with deadlines on parallel machines: An NP-hard case","volume":"64","author":"Kovalyov","year":"1997","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB54","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.40.4.764","article-title":"Efficient algorithms for scheduling semiconductor burn-in operations","volume":"40","author":"Lee","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB55","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0305-0548(96)00051-2","article-title":"Single machine scheduling with major and minor setup times","volume":"24","author":"Liao","year":"1997","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB56","unstructured":"A.J. Mason, Genetic Algorithms and Scheduling Problems, Ph.D. Thesis, Department of Engineering, University of Cambridge, UK, 1992"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB57","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/1520-6750(199106)38:3<333::AID-NAV3220380305>3.0.CO;2-0","article-title":"Minimizing flow time on a single machine with job classes and setup times","volume":"38","author":"Mason","year":"1991","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB58","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(99)00153-8_BIB59","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","article-title":"On the complexity of scheduling with batch setup times","volume":"37","author":"Monma","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB60","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1287\/opre.41.5.981","article-title":"Analysis of heuristics for preemptive parallel machine scheduling with batch setup times","volume":"41","author":"Monma","year":"1993","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB61","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(99)00153-8_BIB62","unstructured":"C.N. Potts, V.A. Strusevich, T. Tautenhahn, Scheduling batches with simultaneous job processing for two-machine shop problems, Report, Faculty of Mathematical Studies, University of Southampton, UK, 1998"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB63","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","article-title":"Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity","volume":"43","author":"Potts","year":"1992","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB64","unstructured":"G. Rote, G.J. Woeginger, Minimizing the number of tardy jobs on a single machine with batch setup times, Report Woe-23, START Project Y43-MAT, Institut f\u00fcr Mathematik, TU Graz, Austria, 1998"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB65","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1287\/mnsc.42.8.1165","article-title":"Single-machine scheduling with release dates, due dates and family setup times","volume":"42","author":"Schutten","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB66","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(99)00153-8_BIB67","unstructured":"A.H.G. Rinnooy Kan, Machine Scheduling Problems, Martinus Nijhoff, The Hague, 1976"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB68","unstructured":"C.A. Santos, Batching and Sequencing Decisions under Lead Time Considerations for Single Machine Problems, M.Sc. Thesis, Department of Management Sciences, University of Waterloo, Canada, 1984"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB69","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0167-6377(85)90011-2","article-title":"Batching in single operation manufacturing systems","volume":"4","author":"Santos","year":"1985","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB70","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0167-6377(92)90027-Z","article-title":"A polynomial algorithm for a one machine batching problem","volume":"11","author":"Shallcross","year":"1992","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB71","doi-asserted-by":"crossref","first-page":"1721","DOI":"10.1080\/00207549308956819","article-title":"Scheduling a flow-line manufacturing cell: A tabu search approach","volume":"31","author":"Skorin-Kapov","year":"1993","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB72","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF01539731","article-title":"Heuristics for permutation flow shop scheduling with batch setup times","volume":"18","author":"Sotskov","year":"1996","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB73","unstructured":"V.S. Tanaev, M.Y. Kovalyov, Y.M. Shafransky, Scheduling Theory. Group Technologies (in Russian), Institute of Engineering Cybernetics, National Academy of Sciences of Belarus, Minsk, 1998"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB74","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1002\/1520-6750(199008)37:4<559::AID-NAV3220370409>3.0.CO;2-8","article-title":"A simulated annealing approach to scheduling a manufacturing cell","volume":"37","author":"Vakharia","year":"1990","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB75","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/0377-2217(94)90077-9","article-title":"Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions","volume":"75","author":"van Hoesel","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB76","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1080\/07408179308964278","article-title":"Batching and sequencing of components at a single facility","volume":"25","author":"Vickson","year":"1993","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB77","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0167-6377(96)00054-5","article-title":"The complexity of scheduling job families about a common due date","volume":"20","author":"Webster","year":"1997","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB78","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1287\/opre.46.3.423","article-title":"Note on \u201cParallel machine scheduling with batch setup times\u201d","volume":"46","author":"Webster","year":"1998","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB79","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.43.4.692","article-title":"Scheduling groups of jobs on a single machine","volume":"43","author":"Webster","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB80","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1057\/jors.1996.15","article-title":"A new heuristic for a single machine scheduling problem with set-up times","volume":"47","author":"Williams","year":"1996","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB81","unstructured":"G.J. Woeginger, A polynomial time approximation scheme for single machine sequencing with delivery times and sequence independent batch setup times, Report Woe-17, START Project Y43-MAT, Institut f\u00fcr Mathematik, TU Graz, Austria, 1997"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB82","doi-asserted-by":"crossref","unstructured":"X. Yang, Scheduling with generalized batch delivery dates and earliness penalties, IIE Transactions, in press","DOI":"10.1080\/07408170008967431"},{"key":"10.1016\/S0377-2217(99)00153-8_BIB83","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0377-2217(93)E0160-Y","article-title":"Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times","volume":"80","author":"Zdrza\u0142ka","year":"1995","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799001538?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799001538?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T10:55:25Z","timestamp":1556276125000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799001538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":83,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0377221799001538"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00153-8","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}