{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T15:39:49Z","timestamp":1778513989505,"version":"3.51.4"},"reference-count":137,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":[[2002,5]]},"DOI":"10.1016\/s0377-2217(01)00181-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:22:16Z","timestamp":1027592536000},"page":"1-25","source":"Crossref","is-referenced-by-count":379,"title":["A survey of the state-of-the-art of common due date assignment and scheduling research"],"prefix":"10.1016","volume":"139","author":[{"given":"Valery","family":"Gordon","sequence":"first","affiliation":[]},{"given":"Jean-Marie","family":"Proth","sequence":"additional","affiliation":[]},{"given":"Chengbin","family":"Chu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00181-3_BIB1","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1016\/S0377-2217(97)00057-X","article-title":"Scheduling under a common due-date on parallel unrelated machines","volume":"105","author":"Adamopoulos","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0377-2217(93)90245-I","article-title":"Two parallel machine sequencing problems involving controllable job processing times","volume":"70","author":"Alidaee","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1057\/jors.1993.4","article-title":"Single stage minimum absolute lateness problem with a common due date on non-identical machines","volume":"44","author":"Alidaee","year":"1993","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB4","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1080\/07408179708966418","article-title":"Scheduling about an unrestricted common due window with arbitrary earliness\/tardiness penalty rates","volume":"29","author":"Azizoglu","year":"1997","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB5","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1080\/002075497195344","article-title":"Scheduling job families about an unrestricted common due date on a single machine","volume":"35","author":"Azizoglu","year":"1997","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB6","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1002\/1520-6750(198710)34:5<739::AID-NAV3220340513>3.0.CO;2-3","article-title":"Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date","volume":"34","author":"Bagchi","year":"1987","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB7","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/nav.3800330206","article-title":"Minimizing mean absolute deviation of completion times about a common due date","volume":"33","author":"Bagchi","year":"1986","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB8","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1287\/mnsc.33.7.894","article-title":"Minimizing mean squared deviation of completion times about a common due date","volume":"33","author":"Bagchi","year":"1987","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB9","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1057\/jors.1989.9","article-title":"On the assignment of optimal due dates","volume":"40","author":"Baker","year":"1989","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB10","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tardiness penalties: A review","volume":"38","author":"Baker","year":"1990","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB11","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1080\/00207548808947888","article-title":"Determination of an optimal common due date and optimal sequence in a single machine job shop","volume":"26","author":"Bector","year":"1988","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","article-title":"Single-machine scheduling with learning considerations","volume":"115","author":"Biskup","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB13","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1080\/03052159908941376","article-title":"Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties","volume":"31","author":"Biskup","year":"1999","journal-title":"Engineering Optimization"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0305-0548(98)00044-6","article-title":"Multiple-machine scheduling with earliness, tardiness and completion time penalties","volume":"26","author":"Biskup","year":"1999","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB15","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/S0305-0548(00)00008-3","article-title":"Benchmarks for scheduling on a single-machine against restrictive and unrestrictive common due dates","volume":"28","author":"Biskup","year":"2001","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB16","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0925-5273(00)00040-2","article-title":"Common due date assignment for scheduling on a single machine with jointly reducible processing times","volume":"69","author":"Biskup","year":"2001","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB17","series-title":"Scheduling Computer and Manufacturing Processes","author":"Blazewicz","year":"1996"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB18","series-title":"Scheduling in Computer and Manufacturing Systems","author":"Blazewicz","year":"1993"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB19","doi-asserted-by":"crossref","unstructured":"Blazewicz, J., Pesch, E., Sterna, M., Werner, F., 2000. Total late work criteria for scheduling problems. In: Inderfurth, K. et al. (Eds.) Operations Research Proceedings 1999, Springer, Berlin, pp. 354\u2013359","DOI":"10.1007\/978-3-642-58300-1_54"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB20","series-title":"Scheduling Algorithms","author":"Brucker","year":"1998"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB21","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/361011.361064","article-title":"Scheduling independent tasks to reduce mean finishing time","volume":"17","author":"Bruno","year":"1974","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB22","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/0377-2217(93)E0367-7","article-title":"Minimization of agreeably weighted variance in single machine systems","volume":"85","author":"Cai","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB23","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/0377-2217(95)00253-7","article-title":"Scheduling about a common due date with job-dependent asymmetric earliness and tardiness penalties","volume":"98","author":"Cai","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB24","doi-asserted-by":"crossref","unstructured":"Chen, B., Potts, C.N., Woeginger, G.J., 1998. A review of machine scheduling: Complexity, algorithms and approximability. In: Du, D.-Z., Pardalos, P.M. (Eds.), Handbook of Combinatorial Optimization, Kluwer, Dordrecht, pp. 21\u2013169","DOI":"10.1007\/978-1-4613-0303-9_25"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB25","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0895-7177(97)00017-4","article-title":"Single machine scheduling with common due date assignment in a group technology environment","volume":"25","author":"Chen","year":"1997","journal-title":"Mathematical and Computer Modelling"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB26","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0377-2217(95)00133-6","article-title":"Scheduling and common due date assignment with earliness\u2013tardiness penalties and batch delivery costs","volume":"93","author":"Chen","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB27","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1080\/03052158508902508","article-title":"A duality approach to optimal due-date determination","volume":"9","author":"Cheng","year":"1985","journal-title":"Engineering Optimization"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB28","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1016\/0305-0548(87)90048-7","article-title":"An algorithm for the CON due-date determination and sequencing problem","volume":"14","author":"Cheng","year":"1987","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB29","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0898-1221(87)90136-2","article-title":"Minimizing the maximum deviation of job completion time about a common due-date","volume":"14","author":"Cheng","year":"1987","journal-title":"Computers and Mathematics with Applications"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB30","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0548(88)90001-9","article-title":"Optimal common due-date with limited completion time deviation","volume":"15","author":"Cheng","year":"1988","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB31","doi-asserted-by":"crossref","unstructured":"Cheng, T.C.E., 1988b. An alternative proof of optimality for the common due-date assignment problem, European Journal of Operational Research 37, 250\u2013253; Corrigendum: European Journal of Operational Research 38 (1989) 259","DOI":"10.1016\/0377-2217(89)90112-4"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB32","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1057\/jors.1989.194","article-title":"A heuristic for common due-date assignment and job scheduling on parallel machines","volume":"40","author":"Cheng","year":"1989","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB33","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0305-0548(90)90009-V","article-title":"A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem","volume":"17","author":"Cheng","year":"1990","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB34","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/03052159008941168","article-title":"Common due-date assignment and scheduling for a single processor to minimize the number of tardy jobs","volume":"16","author":"Cheng","year":"1990","journal-title":"Engineering Optimization"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB35","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0925-5273(91)90101-X","article-title":"Optimal constant due-date determination and sequencing of n jobs on a single machine","volume":"22","author":"Cheng","year":"1991","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB36","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1057\/jors.1994.106","article-title":"Parallel-machine scheduling problems with earliness and tardiness penalties","volume":"45","author":"Cheng","year":"1994","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB37","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0377-2217(89)90100-8","article-title":"Survey of scheduling research involving due date determination decisions","volume":"38","author":"Cheng","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB38","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(01)00181-3_BIB39","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0925-5273(95)00194-8","article-title":"Due-date assignment and single machine scheduling with compressible processing times","volume":"43","author":"Cheng","year":"1996","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB40","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","article-title":"A state-of-the-art review of parallel-machine scheduling research","volume":"47","author":"Cheng","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB41","first-page":"228","article-title":"Priority dispatching and job lateness in a job shop","volume":"16","author":"Conway","year":"1965","journal-title":"Journal of Industrial Engineering"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB42","unstructured":"Chretienne, P., Coffman, Jr., E.G., Lenstra, J. K., Liu, Z. (Eds.), 1995. Scheduling Theory and its Applications. Wiley, Chichester"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB43","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1002\/1520-6750(199302)40:1<85::AID-NAV3220400106>3.0.CO;2-C","article-title":"Single-machine scheduling with early and tardy completion costs","volume":"40","author":"Davis","year":"1993","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB44","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1287\/mnsc.35.9.1143","article-title":"A note on the minimization of mean squared deviation of completion times about a common due date","volume":"35","author":"De","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB45","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0305-0548(90)90011-U","article-title":"CON due-date determination and sequencing","volume":"17","author":"De","year":"1990","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB46","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0305-0548(90)90046-A","article-title":"Scheduling about a common due date with earliness and tardiness penalties","volume":"17","author":"De","year":"1990","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB47","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1111\/j.1540-5915.1991.tb00353.x","article-title":"Optimal delivery time quotation and order sequencing","volume":"22","author":"De","year":"1991","journal-title":"Decision Science"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB48","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1057\/jors.1991.84","article-title":"On the multiple-machine extension to a common due-date assignment and scheduling problem","volume":"42","author":"De","year":"1991","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB49","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1287\/opre.40.6.1148","article-title":"On the minimization of completion time variance with a bicriteria extension","volume":"40","author":"De","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB50","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0305-0548(93)90070-Y","article-title":"On the general solution for a class of early\/tardy problems","volume":"20","author":"De","year":"1993","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB51","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0925-5273(94)90034-5","article-title":"Solving a generalized model for CON due date assignment and sequencing","volume":"34","author":"De","year":"1994","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB52","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1002\/1520-6750(199402)41:1<17::AID-NAV3220410103>3.0.CO;2-X","article-title":"Due-date assignment and early\/tardy scheduling on identical parallel machines","volume":"41","author":"De","year":"1994","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB53","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/S0377-2217(99)00164-2","article-title":"Minimizing tardy jobs in a flowshop with common due date","volume":"120","author":"Della Croce","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB54","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0305-0548(91)90048-V","article-title":"Optimal common due date with limited completion time","volume":"18","author":"Dickman","year":"1991","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB55","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0305-0548(93)90073-R","article-title":"Common due date scheduling problem with separate earliness and tardiness penalties","volume":"20","author":"Dileepan","year":"1993","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB56","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1080\/00207547608956596","article-title":"Due dates in job shop scheduling","volume":"14","author":"Eilon","year":"1976","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB57","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1002\/1520-6750(198712)34:6<803::AID-NAV3220340605>3.0.CO;2-2","article-title":"Scheduling to a common due date on parallel uniform processors","volume":"34","author":"Emmons","year":"1987","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB58","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1002\/1520-6750(199312)40:7<951::AID-NAV3220400707>3.0.CO;2-1","article-title":"Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problems","volume":"40","author":"Federgruen","year":"1993","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB59","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0167-6377(94)90069-8","article-title":"Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs","volume":"16","author":"Federgruen","year":"1994","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB60","unstructured":"Feldmann, M., Biskup, D., 1999. Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristc approaches, University of Bielefeld Discussion Paper No. 425, 1-28; International Journal of Applied Intelligence, to appear"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB61","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","article-title":"One-processor scheduling with symmetric earliness and tardiness penalties","volume":"13","author":"Garey","year":"1988","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB62","doi-asserted-by":"crossref","first-page":"1839","DOI":"10.1080\/00207549308956826","article-title":"Selecting allowance policies for improved job shop performance","volume":"31","author":"Gee","year":"1993","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB63","unstructured":"Gordon, V.S., Proth, J.-M., Chu, C., 1998. A state-of-the-art survey of due date assignment and scheduling research: SLK, TWK, and other due date assignment models. INRIA Rapport de Recherche 3537, 1\u201337; Production Planning and Control, to appear"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB64","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0377-2217(93)90240-N","article-title":"Minimizing flow time variance in a single machine system using genetic algorithms","volume":"70","author":"Gupta","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB65","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0305-0483(87)90071-5","article-title":"Single machine scheduling research","volume":"15","author":"Gupta","year":"1987","journal-title":"OMEGA"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB66","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0166-3615(90)90023-I","article-title":"Optimal schedule on a single machine using various due date determination methods","volume":"15","author":"Gupta","year":"1990","journal-title":"Computers in Industry"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB67","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1080\/07408178608975351","article-title":"Scheduling problems with generalized due dates","volume":"18","author":"Hall","year":"1986","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB68","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/nav.3800330105","article-title":"Single- and multiple-processor models for minimizing completion time variance","volume":"33","author":"Hall","year":"1986","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB69","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1287\/opre.39.5.847","article-title":"Earliness\u2013tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB70","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.39.5.836","article-title":"Earliness\u2013tardiness scheduling problems, I: Weighted deviation of completion times about a common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB71","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/0377-2217(91)90149-P","article-title":"On the complexity of generalized due date scheduling problems","volume":"51","author":"Hall","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB72","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/0305-0548(95)00051-8","article-title":"Common due date determination and sequencing using tabu search","volume":"23","author":"Hao","year":"1996","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB73","series-title":"Inequalities","author":"Hardy","year":"1934"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB74","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/0377-2217(93)90239-J","article-title":"On scheduling to minimize earliness\u2013tardiness and batch delivery costs with a common due date","volume":"70","author":"Herrmann","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB75","unstructured":"Hoogeveen, J.A., Lenstra, J.K., van de Velde, S.L., 1997. Sequencing and scheduling: An annotated bibliography, Memorandum COSOR 97 - 02, Eindhoven University of Technology, pp. 1\u201317"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB76","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/opre.42.1.102","article-title":"New lower and upper bounds for scheduling around a small common due date","volume":"42","author":"Hoogeveen","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB77","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0377-2217(91)90228-N","article-title":"Scheduling around a small common due date","volume":"55","author":"Hoogeveen","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB78","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1287\/ijoc.9.1.92","article-title":"Earliness\u2013tardiness scheduling around almost equal due date","volume":"9","author":"Hoogeveen","year":"1997","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB79","unstructured":"Jackson, J.R., 1955. Scheduling a production line to minimize maximum tardiness. Management Science Research Project, UCLA"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB80","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0305-0548(96)00052-4","article-title":"Using tabu search to solve the common due date early\/tardy machine scheduling problem","volume":"24","author":"James","year":"1997","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB81","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0167-6377(94)90041-8","article-title":"Scheduling shops to minimize the weighted number of late jobs","volume":"16","author":"Jozefowska","year":"1994","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB82","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0166-218X(96)00040-6","article-title":"Algorithms for minclique scheduling problems","volume":"72","author":"Jurisch","year":"1997","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB83","first-page":"111","article-title":"SWEAT \u2013 a program for a scheduling problem with earliness and tardiness penalties","volume":"43","author":"Kahlbacher","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB84","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0377-2217(93)90181-L","article-title":"Scheduling with monotonous earliness and tardiness penalties","volume":"64","author":"Kahlbacher","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB85","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0166-218X(93)90088-6","article-title":"Parallel machine scheduling to minimize costs for earliness and number of tardy jobs","volume":"47","author":"Kahlbacher","year":"1993","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB86","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1002\/nav.3800280411","article-title":"Minimizing the average deviation of job completion times about a common due date","volume":"28","author":"Kanet","year":"1981","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB87","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1057\/jors.1995.106","article-title":"Form similarities of the CON and SLK due date determination methods","volume":"46","author":"Karacapilidis","year":"1995","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB88","first-page":"289","article-title":"Optimization algorithms for a class of single machine scheduling problems using due date determination methods","volume":"5","author":"Karacapilidis","year":"1995","journal-title":"Yugoslavian Journal of Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB89","doi-asserted-by":"crossref","first-page":"190","DOI":"10.15807\/jorsj.31.190","article-title":"Deterministic scheduling in computer systems: A survey","volume":"31","author":"Kawaguchi","year":"1988","journal-title":"Journal of the Operational Research Society of Japan"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB90","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1287\/opre.42.6.1025","article-title":"The total tardiness problem: Review and extensions","volume":"42","author":"Koulamas","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB91","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(01)00181-3_BIB92","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1287\/opre.47.5.757","article-title":"A fully polynomial approximation scheme for the weighted earliness\u2013tardiness problem","volume":"47","author":"Kovalyov","year":"1999","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB93","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.1937-5956.1993.tb00102.x","article-title":"Common due-window scheduling","volume":"2","author":"Kramer","year":"1993","journal-title":"Production and Operations Management"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB94","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-6377(93)90019-D","article-title":"Completion time variance minimization on a single machine is difficult","volume":"14","author":"Kubiak","year":"1993","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB95","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(93)E0125-I","article-title":"New results on the completion time variance minimization","volume":"58","author":"Kubiak","year":"1995","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB96","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0167-6377(90)90056-B","article-title":"Equivalence of mean flow time problems and mean absolute deviation problems","volume":"9","author":"Kubiak","year":"1990","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB97","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1287\/opre.26.6.1079","article-title":"Optimal single-machine scheduling with earliness and tardiness penalties","volume":"26","author":"Lakshminarayan","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB98","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., 1993. Sequencing and scheduling: Algorithms and complexity. In: Graves S.C., Zipkin P.H., Rinnooy Kan A.H.G. (Eds.), Logistics of Production and Inventory; Handbooks in Operations Research and Management Science, vol. 4, North-Holland, Amsterdam, pp. 445\u2013522","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB99","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","article-title":"A functional equation and its application to resource allocations and sequencing problems","volume":"16","author":"Lawler","year":"1969","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB100","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1080\/07408179508936781","article-title":"Estimating flowtimes and setting due-dates in complex production systems","volume":"27","author":"Lawrence","year":"1995","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB101","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0305-0548(91)90098-C","article-title":"Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date","volume":"18","author":"Lee","year":"1991","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB102","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0360-8352(94)00197-U","article-title":"Parallel genetic algorithms for the earliness tardiness job scheduling problem with general penalty weights","volume":"28","author":"Lee","year":"1995","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB103","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/1520-6750(199402)41:1<33::AID-NAV3220410104>3.0.CO;2-S","article-title":"The parallel machine min\u2013max weighted absolute lateness scheduling problem","volume":"41","author":"Li","year":"1994","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB104","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0377-2217(95)00181-6","article-title":"Determination of common due window location in a single machine scheduling problem","volume":"93","author":"Liman","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB105","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1057\/palgrave.jors.2600601","article-title":"Common due window size and location determination in a single machine scheduling problem","volume":"49","author":"Liman","year":"1998","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB106","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/mnsc.18.9.518","article-title":"Variance minimization in a single machine sequencing problems","volume":"18","author":"Merten","year":"1972","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB107","unstructured":"Monden, Y. 1983. Toyota Production Systems. Industrial Engineering and Management Press. Norcross, GA"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB108","series-title":"Heuristic Scheduling Systems","author":"Morton","year":"1993"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB109","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0377-2217(92)90144-X","article-title":"Single machine sequencing with controllable processing times","volume":"59","author":"Panwalkar","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB110","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/opre.30.2.391","article-title":"Common due date assignment to minimize total penalty for the one machine scheduling problem","volume":"30","author":"Panwalkar","year":"1982","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB111","first-page":"189","article-title":"Scheduling under the due date criterion with varying penalties for lateness","volume":"3","author":"Pappis","year":"1993","journal-title":"Yugoslavian Journal of Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB112","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1002\/(SICI)1520-6750(199702)44:1<21::AID-NAV2>3.0.CO;2-O","article-title":"Cost-based due-date assignment with the use of classical and neural-network approaches","volume":"44","author":"Philipoom","year":"1997","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB113","series-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB114","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1057\/jors.1987.58","article-title":"A generalized model of optimal due-date assignment by linear programming","volume":"38","author":"Quaddus","year":"1987","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB115","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0377-2217(86)90306-1","article-title":"A V-shape property of optimal schedule of jobs about a common due date","volume":"23","author":"Raghavachari","year":"1986","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB116","first-page":"144","article-title":"Scheduling problems with non-regular penalty functions \u2013 a review","volume":"25","author":"Raghavachari","year":"1988","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB117","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0305-0483(90)90017-4","article-title":"Dynamic job shop scheduling: A survey of simulation research","volume":"18","author":"Ramasesh","year":"1990","journal-title":"OMEGA"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB118","doi-asserted-by":"crossref","first-page":"1539","DOI":"10.1080\/00207549608904983","article-title":"Dynamic assignation of due-dates in an assembly shop based in simulation","volume":"34","author":"Roman","year":"1996","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB119","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0307-904X(94)00022-X","article-title":"Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem","volume":"19","author":"Sarper","year":"1995","journal-title":"Applied Mathematics Modelling"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB120","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1080\/00207548108956667","article-title":"Optimal assignment of due-dates for a single processor scheduling problem","volume":"19","author":"Seidmann","year":"1981","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB121","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0483(84)90011-2","article-title":"A state-of-art survey of static scheduling research involving due dates","volume":"12","author":"Sen","year":"1984","journal-title":"OMEGA"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB122","doi-asserted-by":"crossref","first-page":"2375","DOI":"10.1080\/00207549508904821","article-title":"Regression-based due date assignment rules for improved assembly shop performance","volume":"33","author":"Smith","year":"1995","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB123","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/nav.3800310214","article-title":"Minimizing the sum of absolute lateness in single-machine and multimachine scheduling","volume":"31","author":"Sundararaghavan","year":"1984","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB124","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1002\/1520-6750(198910)36:5<663::AID-NAV3220360510>3.0.CO;2-X","article-title":"Single-machine scheduling to minimize absolute deviation of completion times from a common due date","volume":"36","author":"Szwarc","year":"1989","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB125","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0305-0548(95)O0025-O","article-title":"The weighted common due date single machine scheduling problem revisited","volume":"23","author":"Szwarc","year":"1996","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB126","series-title":"Scheduling Theory: Single-Stage Systems","author":"Tanaev","year":"1994"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB127","series-title":"Scheduling Theory: Multi-Stage Systems","author":"Tanaev","year":"1994"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB128","doi-asserted-by":"crossref","first-page":"3379","DOI":"10.1080\/002075497194138","article-title":"Integrating order release control with due-date assignment rules","volume":"35","author":"Tsai","year":"1997","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB129","unstructured":"Van den Akker, M., Hoogeveen, H., van de Velde, S., 2000. Combining column generation and Lagrangean relaxation: an application to a single-machine common due date scheduling problem. In: Brucker, P., Heitman, S., Hurink, J., Knust S. (Eds.), Seventh International Workshop on Project Management and Scheduling (PMS 2000). Exrended Abstracts, Osnabruck, pp. 35\u201338"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB130","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0167-6377(95)00006-6","article-title":"An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date","volume":"17","author":"Ventura","year":"1995","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB131","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1080\/00207549108948016","article-title":"Dynamic rules for due date assignments","volume":"29","author":"Vig","year":"1991","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB132","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0272-6963(93)90034-M","article-title":"Mixing static and dynamic flowtime estimates for due-date assignment","volume":"11","author":"Vig","year":"1993","journal-title":"Journal of Operations Management"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB133","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1287\/mnsc.23.8.872","article-title":"A methodology for assigning minimum cost due-dates","volume":"23","author":"Weeks","year":"1979","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB134","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(01)00181-3_BIB135","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1002\/1520-6750(199410)41:6<843::AID-NAV3220410612>3.0.CO;2-K","article-title":"Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times","volume":"41","author":"Weng","year":"1994","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB136","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1016\/S0305-0548(96)00020-2","article-title":"Optimal common due-date completion time tolerance","volume":"23","author":"Wilamowsky","year":"1996","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00181-3_BIB137","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0305-0548(99)00097-0","article-title":"Single-machine scheduling with a common due window","volume":"28","author":"Yeung","year":"2001","journal-title":"Computers and Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701001813?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701001813?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T02:23:46Z","timestamp":1556850226000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701001813"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":137,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0377221701001813"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00181-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}