{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T00:27:59Z","timestamp":1772497679621,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T00:00:00Z","timestamp":1329264000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10951-012-0270-4","type":"journal-article","created":{"date-parts":[[2012,2,14]],"date-time":"2012-02-14T14:18:49Z","timestamp":1329229129000},"page":"161-183","source":"Crossref","is-referenced-by-count":28,"title":["A linear programming-based method for job shop scheduling"],"prefix":"10.1007","volume":"16","author":[{"given":"Kerem","family":"B\u00fclb\u00fcl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip","family":"Kaminsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,15]]},"reference":[{"issue":"3","key":"270_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J. Adams","year":"1988","unstructured":"Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job shop scheduling. Management Science, 34(3), 391\u2013401.","journal-title":"Management Science"},{"key":"270_CR2","unstructured":"Asadathorn, N. (1997). Scheduling of assembly type of manufacturing systems: algorithms and systems developments. PhD thesis, Department of Industrial Engineering, New Jersey Institute of Technology, Newark, NJ."},{"key":"270_CR3","unstructured":"Avci, S., & Storer, R. (2004). Compact local search neighborhoods for generalized scheduling. Working paper."},{"key":"270_CR4","unstructured":"Bulbul, K. (2002). Just-in-time scheduling with inventory holding costs. PhD thesis, University of California at Berkeley."},{"issue":"6","key":"270_CR5","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1016\/j.cor.2010.09.015","volume":"38","author":"K. Bulbul","year":"2011","unstructured":"Bulbul, K. (2011). A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem. Computers & Operations Research, 38(6), 967\u2013983. http:\/\/dx.doi.org\/10.1016\/j.cor.2010.09.015","journal-title":"Computers & Operations Research"},{"issue":"3","key":"270_CR6","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1002\/nav.20000","volume":"51","author":"K. Bulbul","year":"2004","unstructured":"Bulbul, K., Kaminsky, P., & Yano, C. (2004). Flow shop scheduling with earliness, tardiness and intermediate inventory holding costs. Naval Research Logistics, 51(3), 407\u2013445.","journal-title":"Naval Research Logistics"},{"issue":"4\u20135","key":"270_CR7","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10951-007-0028-6","volume":"10","author":"K. Bulbul","year":"2007","unstructured":"Bulbul, K., Kaminsky, P., & Yano, C. (2007). Preemption in single machine earliness\/tardiness scheduling. Journal of Scheduling, 10(4\u20135), 271\u2013292.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"270_CR8","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1109\/70.282536","volume":"10","author":"S.-C. Chang","year":"1994","unstructured":"Chang, S.-C., & Liao, D.-Y. (1994). Scheduling flexible flow shops with no setup effects. IEEE Transactions on Robotics and Automation, 10(2), 112\u2013122.","journal-title":"IEEE Transactions on Robotics and Automation"},{"issue":"8","key":"270_CR9","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1080\/15458830.1996.11770708","volume":"28","author":"Y. L. Chang","year":"1996","unstructured":"Chang, Y. L., Sueyoshi, T., & Sullivan, R. (1996). Ranking dispatching rules by data envelopment analysis in a jobshop environment. IIE Transactions, 28(8), 631\u2013642.","journal-title":"IIE Transactions"},{"issue":"2","key":"270_CR10","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1009627429878","volume":"3","author":"E. Demirkol","year":"1997","unstructured":"Demirkol, E., Mehta, S., & Uzsoy, R. (1997). A computational study of shifting bottleneck procedures for shop scheduling problems. Journal of Heuristics, 3(2), 111\u2013137.","journal-title":"Journal of Heuristics"},{"issue":"2\u20133","key":"270_CR11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(90)90104-K","volume":"26","author":"M. Dyer","year":"1990","unstructured":"Dyer, M., & Wolsey, L. (1990). Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics, 26(2\u20133), 255\u2013270.","journal-title":"Discrete Applied Mathematics"},{"key":"270_CR12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., & Rinnooy Kan, A. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"2","key":"270_CR13","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/S0377-2217(03)00204-2","volume":"157","author":"M. Jayamohan","year":"2004","unstructured":"Jayamohan, M., & Rajendran, C. (2004). Development and analysis of cost-based dispatching rules for job shop scheduling. European Journal of Operations Research, 157(2), 307\u2013321.","journal-title":"European Journal of Operations Research"},{"issue":"11","key":"270_CR14","first-page":"1085","volume":"30","author":"C. Kaskavelis","year":"1998","unstructured":"Kaskavelis, C., & Caramanis, M. (1998). Efficient Lagrangian relaxation algorithms for industry size job-shop scheduling problems. IIE Transactions, 30(11), 1085\u20131097.","journal-title":"IIE Transactions"},{"issue":"8","key":"270_CR15","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1016\/j.cor.2009.11.002","volume":"37","author":"S. Kedad-Sidhoum","year":"2010","unstructured":"Kedad-Sidhoum, S., & Sourd, F. (2010). Fast neighborhood search for the single machine earliness-tardiness scheduling problem. Computers & Operations Research, 37(8), 1464\u20131471.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"270_CR16","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<125::AID-JOS40>3.0.CO;2-C","volume":"3","author":"S. Kreipl","year":"2000","unstructured":"Kreipl, S. (2000). A large step random walk for minimizing total weighted tardiness in a job shop. Journal of Scheduling, 3(3), 125\u2013138.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"270_CR17","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1080\/002075499191995","volume":"37","author":"E. Kutanoglu","year":"1999","unstructured":"Kutanoglu, E., & Sabuncuoglu, I. (1999). An analysis of heuristics in a dynamic job shop with weighted tardiness objectives. International Journal of Production Research, 37(1), 165\u2013187.","journal-title":"International Journal of Production Research"},{"key":"270_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/978-1-59904-582-5.ch001","volume-title":"Handbook of Computational Intelligence in Manufacturing and Production Management","author":"D. Laha","year":"2007","unstructured":"Laha, D. (2007). Heuristics and metaheuristics for solving scheduling problems. In D. Laha & P. Mandal (Eds.), Handbook of Computational Intelligence in Manufacturing and Production Management (Chap.\u00a01, pp. 1\u201318). Hershey: Idea Group."},{"key":"270_CR19","unstructured":"LEKIN\u00ae-Flexible Job-Shop Scheduling System (2002). Version\u00a02.4. http:\/\/www.stern.nyu.edu\/om\/software\/lekin\/index.htm ."},{"key":"270_CR20","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J. Lenstra","year":"1977","unstructured":"Lenstra, J., Rinnooy\u00a0Kan, A., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"issue":"3","key":"270_CR21","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/jos.102","volume":"5","author":"S. Mason","year":"2002","unstructured":"Mason, S., Fowler, J., & Carlyle, W. (2002). A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. Journal of Scheduling, 5(3), 247\u2013262.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"270_CR22","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ijpe.2005.05.004","volume":"101","author":"H. Ohta","year":"2006","unstructured":"Ohta, H., & Nakatanieng, T. (2006). A heuristic job-shop scheduling algorithm to minimize the total holding cost of completed and in-process products subject to no tardy jobs. International Journal of Production Economics, 101(1), 19\u201329.","journal-title":"International Journal of Production Economics"},{"key":"270_CR23","volume-title":"Decomposition methods for complex factory scheduling problems","author":"I. M. Ovacik","year":"1996","unstructured":"Ovacik, I. M., & Uzsoy, R. (1996). Decomposition methods for complex factory scheduling problems. Berlin: Springer."},{"issue":"3","key":"270_CR24","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/S0377-2217(99)00108-3","volume":"123","author":"M.-W. Park","year":"2000","unstructured":"Park, M.-W., & Kim, Y.-D. (2000). A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints. European Journal of Operations Research, 123(3), 504\u2013518.","journal-title":"European Journal of Operations Research"},{"issue":"1","key":"270_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/(SICI)1520-6750(199902)46:1<1::AID-NAV1>3.0.CO;2-#","volume":"46","author":"M. Pinedo","year":"1999","unstructured":"Pinedo, M., & Singer, M. (1999). A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics, 46(1), 1\u201317.","journal-title":"Naval Research Logistics"},{"issue":"3","key":"270_CR26","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0305-0548(99)00098-2","volume":"28","author":"M. Singer","year":"2001","unstructured":"Singer, M. (2001). Decomposition methods for large job shops. Computers & Operations Research, 28(3), 193\u2013207.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"270_CR27","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1287\/ijoc.1080.0287","volume":"21","author":"F. Sourd","year":"2009","unstructured":"Sourd, F. (2009). New exact algorithms for one-machine earliness-tardiness scheduling. INFORMS Journal on Computing, 21(1), 167\u2013175.","journal-title":"INFORMS Journal on Computing"},{"key":"270_CR28","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/COASE.2008.4626508","volume-title":"IEEE international conference on automation science and engineering, 2008. CASE 2008","author":"S. Tanaka","year":"2008","unstructured":"Tanaka, S., & Fujikuma, S. (2008). An efficient exact algorithm for general single-machine scheduling with machine idle time. In IEEE international conference on automation science and engineering, 2008. CASE 2008 (pp. 371\u2013376)."},{"issue":"4","key":"270_CR29","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/j.cie.2005.06.005","volume":"49","author":"S. Thiagarajan","year":"2005","unstructured":"Thiagarajan, S., & Rajendran, C. (2005). Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs. Computers and Industrial Engineering, 49(4), 463\u2013503.","journal-title":"Computers and Industrial Engineering"},{"issue":"8","key":"270_CR30","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","volume":"33","author":"A. P. J. Vepsalainen","year":"1987","unstructured":"Vepsalainen, A. P. J., & Morton, T. E. (1987). Priority rules for job shops with weighted tardiness costs. Management Science, 33(8), 1035\u20131047.","journal-title":"Management Science"},{"key":"270_CR31","series-title":"Studies in computational intelligence","volume-title":"Metaheuristics for scheduling in industrial and manufacturing applications","year":"2008","unstructured":"Xhafa, F., & Abraham, A. (Eds.) (2008). Studies in computational intelligence: Vol. 128. Metaheuristics for scheduling in industrial and manufacturing applications. Berlin: Springer."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0270-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-012-0270-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0270-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:47Z","timestamp":1559453987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-012-0270-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,15]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["270"],"URL":"https:\/\/doi.org\/10.1007\/s10951-012-0270-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,15]]}}}