{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T23:27:17Z","timestamp":1769729237179,"version":"3.49.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,1,12]],"date-time":"2013-01-12T00:00:00Z","timestamp":1357948800000},"content-version":"vor","delay-in-days":4944,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,7]]},"DOI":"10.1016\/s0377-2217(98)00136-2","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"220-232","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":63,"title":["A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem"],"prefix":"10.1016","volume":"116","author":[{"given":"Zhi-Long","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Warren B.","family":"Powell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00136-2_BIB1","doi-asserted-by":"crossref","unstructured":"K.R. Baker, G.D. Scudder, Sequencing with earliness and tardiness penalties: A review, Operations Research 38 (1990)","DOI":"10.1287\/opre.38.1.22"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB2","unstructured":"C. Barnhart, E. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, P.H. Vance, Branch-and-price: Column generation for solving huge integer programs, in: J.R. Birge, K.G. Murty (Eds.), Mathematical Programming: State of the Art 1994, The University of Michigan, 1994, pp. 186\u2013207"},{"issue":"4","key":"10.1016\/S0377-2217(98)00136-2_BIB3","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1287\/mnsc.39.4.477","article-title":"A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times","volume":"39","author":"Cattrysse","year":"1993","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB4","unstructured":"L.M.A. Chan, P. Kaminsky, A. Muriel, D. Simchi-Levi, Machine scheduling, linear programming and list scheduling heuristic, Technical report, Northwestern University, Chicago, 1995"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB5","unstructured":"Z.-L. Chen, W.B. Powell, Solving parallel machine scheduling problems by column generation, Technical report, to appear in INFORMS Journal of Computing"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB6","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 Operational Research Society"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB7","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 Operational Research Society"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","article-title":"Decomposition principle for linear programs","volume":"8","author":"Dantzig","year":"1960","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB9","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(98)00136-2_BIB10","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(98)00136-2_BIB11","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","article-title":"A new optimization algorithm for the vehicle routing problem with time windows","volume":"40","author":"Desrochers","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB12","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"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB13","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(98)00136-2_BIB14","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.39.5.836","article-title":"Earliness-tardiness 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(98)00136-2_BIB15","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1002\/1520-6750(199412)41:7<913::AID-NAV3220410705>3.0.CO;2-A","article-title":"Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates","volume":"41","author":"Kim","year":"1994","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB16","unstructured":"L.S. Lasdon, Optimization Theory for Large Systems, MacMillan, New York, 1970"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0377-2217(88)90377-3","article-title":"A new approach for crew pairing problems by column generation with an application to air transport","volume":"35","author":"Lavoie","year":"1988","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0167-6377(93)90084-T","article-title":"A note on one-processor scheduling with asymmetric earliness and tardiness penalties","volume":"13","author":"Li","year":"1993","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB19","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0305-0548(94)E0012-V","article-title":"Single-machine scheduling to minimize the weighted number of early and tardy aggreeable jobs","volume":"22","author":"Li","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB20","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1287\/ijoc.5.4.420","article-title":"Error bound of a heuristic for the common due date scheduling problem","volume":"5","author":"Liman","year":"1993","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB21","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01471113","article-title":"A search heuristic for just-in-time scheduling in parallel machines","volume":"2","author":"Laguna","year":"1991","journal-title":"Journal of Intelligent Manufacturing"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB22","unstructured":"A. Mehrotra, M.A. Trick, A column generation approach to graph coloring, Technical report, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 1993"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB23","doi-asserted-by":"crossref","unstructured":"G. Nemhauser, L. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988","DOI":"10.1002\/9781118627372"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB24","unstructured":"J.M. van den Akker, J.A. Hoogeveen, S.L. van de Velde, Parallel machine scheduling by column generation, Technical report, Center for Operations Research and Econometrics, Universit\u00e9 Catholique de Louvain, Belgium, 1995"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB25","unstructured":"P.H. Vance, Crew scheduling, cutting stock, and column generation: Solving huge integer programs, Technical report, Ph.D. dissertation, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia, 1993"},{"key":"10.1016\/S0377-2217(98)00136-2_BIB26","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01300970","article-title":"Solving binary cutting stock problems by column generation and branch-and-bound","volume":"3","author":"Vance","year":"1994","journal-title":"Computational Optimization and Applications"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798001362?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798001362?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T11:53:09Z","timestamp":1759837989000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798001362"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0377221798001362"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00136-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0377-2217(98)00136-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}