{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T06:54:41Z","timestamp":1760424881935},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540402053"},{"type":"electronic","value":"9783540448679"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44867-5_19","type":"book-chapter","created":{"date-parts":[[2007,11,30]],"date-time":"2007-11-30T01:34:45Z","timestamp":1196386485000},"page":"223-236","source":"Crossref","is-referenced-by-count":14,"title":["A New Class of Greedy Heuristics for Job Shop Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Marco","family":"Pranzo","sequence":"first","affiliation":[]},{"given":"Carlo","family":"Meloni","sequence":"additional","affiliation":[]},{"given":"Dario","family":"Pacciarelli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"issue":"3","key":"19_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.: The shifting bottleneck procedure for job shop scheduling. Management Science, 34(3) (1988) 391\u2013401","journal-title":"Management Science"},{"issue":"2","key":"19_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"Applegate, D., Cook, W.: A computational study of the job shop scheduling problem. ORSA Journal on Computing, 3(2) (1991) 149\u2013156","journal-title":"ORSA Journal on Computing"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Annals of Discrete Mathematics, 5 (1979) 3\u201351","journal-title":"Annals of Discrete Mathematics"},{"issue":"1","key":"19_CR4","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/mnsc.41.1.94","volume":"41","author":"E. Balas","year":"1995","unstructured":"Balas, E., Lenstra, J. K., Vazacopoulos, A.: The one-machine problem with delayed precedence constraints and its use in job shop scheduling. Management Science, 41(1) (1995) 94\u2013109","journal-title":"Management Science"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/00207548208947745","volume":"21","author":"J. H. Blackstone","year":"1982","unstructured":"Blackstone, J. H., Phillips, D. T., Hogg, G. L.: A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research, 21 (1982) 27\u201345","journal-title":"International Journal of Production Research"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J. Carlier","year":"1982","unstructured":"Carlier, J.: The one-machine sequencing problem. European Journal of Operational Research, 11 (1982) 42\u201347","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"19_CR7","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. S.: Ranking dispatching rules by data envelopment analysis in a job-shop environment. IIE Transaction, 28(8) (1996) 631\u2013642","journal-title":"IIE Transaction"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M. DellAmico","year":"1993","unstructured":"Dell\u2019Amico, M., Trubian, M.: Applying taboo search to the job-shop scheduling problem. Annals of Operations Research, 41 (1993) 231\u2013252","journal-title":"Annals of Operations Research"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L. M.: Ant Colony System: A cooperative learning approach to the travelling salesman problem. IEEE Transaction on Evolutionary Computation, 1(1) (1997) 53\u201366","journal-title":"IEEE Transaction on Evolutionary Computation"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01721162","volume":"11","author":"R. Haupt","year":"1989","unstructured":"Haupt, R.: A survey of priority rule-based scheduling. OR Spektrum, 11 (1989) 3\u201316","journal-title":"OR Spektrum"},{"key":"19_CR11","volume-title":"GSIA","author":"S. Lawrence","year":"1984","unstructured":"Lawrence, S.: Supplement to Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. GSIA, Carnegie Mellon University, Pittsburgh, PA (1984)"},{"key":"19_CR12","series-title":"Technical Report","volume-title":"Machine Scheduling via Alternative Graphs","author":"A. Mascis","year":"2000","unstructured":"Mascis, A., Pacciarelli, D.: Machine Scheduling via Alternative Graphs. Technical Report DIA-46-2000, Dipartimento di Informatica e Automazione, Universit\u00e0 Roma Tre, Roma, Italy (2000)"},{"issue":"3","key":"19_CR13","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","volume":"143","author":"A. Mascis","year":"2002","unstructured":"Mascis, A., Pacciarelli, D.: Job shop scheduling with blocking and no-wait constraints. European Journal of Operational Research, 143(3) (2002) 498\u2013517","journal-title":"European Journal of Operational Research"},{"key":"19_CR14","unstructured":"Mascis, A., Pacciarelli, D., Pranzo, M.: Train scheduling in a regional railway network. Proceedings of the 4th Triennial Symposium on Transportation Analysis (TRISTAN IV), Sao Miguel, Portugal (2001) 487\u2013492"},{"key":"19_CR15","volume-title":"Heuristic Scheduling Systems","author":"T. E. Morton","year":"1993","unstructured":"Morton, T. E., Pentico, D. W.: Heuristic Scheduling Systems. John Wiley and Sons, New York (1993)"},{"volume-title":"Industrial scheduling","year":"1963","key":"19_CR16","unstructured":"Muth, J. F., Thompson, G. L. (eds.): Industrial scheduling. Kluwer Academic Publishers, Amsterdam (1963)"},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E. E., Ham, I.: A heuristic algorithm for the m-machines and n-jobs flow-shop sequencing problem. OMEGA The International Journal of Management Science, 11(1) (1983) 91\u201395","journal-title":"OMEGA The International Journal of Management Science"},{"issue":"6","key":"19_CR18","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop scheduling problem. Management Science, 42(6) (1996) 797\u2013813","journal-title":"Management Science"},{"key":"19_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6329-7","volume-title":"Decomposition methods for complex factory scheduling problems","author":"I. M. Ovacik","year":"1997","unstructured":"Ovacik, I. M., Uzsoy, R.: Decomposition methods for complex factory scheduling problems. Prentice-Hall, Englewood Cliffs, NJ (1997)"},{"issue":"1","key":"19_CR20","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"S. S. Panwalkar","year":"1977","unstructured":"Panwalkar, S. S., Iskander, W.: A survey of scheduling rules. Operations Research, 25(1) (1977) 45\u201361","journal-title":"Operations Research"},{"key":"19_CR21","unstructured":"Pinson, E.: The job shop scheduling problem: a concise survey and some recent developments. In Chr\u00e9tienne, P., Coffman, E. G., Lenstra, J. K., Liu Z. (eds.), Scheduling theory and its applications, Wiley (1997) 277\u2013294"},{"key":"19_CR22","volume-title":"Algorithms and applications for complex job shop scheduling problems","author":"M. Pranzo","year":"2002","unstructured":"Pranzo, M.: Algorithms and applications for complex job shop scheduling problems. Ph.D. Thesis, DSPSA, Universit\u00e0 La Sapienza, Roma, Italy (2002)"},{"key":"19_CR23","volume-title":"Les probl\u00e8mes d\u2019ordonnancement avec contraintes disjonctives","author":"B. Roy","year":"1964","unstructured":"Roy, B., Sussman, R.: Les probl\u00e8mes d\u2019ordonnancement avec contraintes disjonctives. Note DS No. 9bis, SEMA, Paris (1964)"},{"key":"19_CR24","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/S0377-2217(98)00319-1","volume":"118","author":"I. Sabuncuoglu","year":"1999","unstructured":"Sabuncuoglu, I., Bayiz, M.: Job shop scheduling with beam search. European Journal of Operational Research, 118 (1999) 390\u2013412","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"19_CR25","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0166-218X(93)E0127-K","volume":"58","author":"F. Werner","year":"1995","unstructured":"Werner, F., Winkler, A.: Insertion techniques for the heuristic solution of the job-shop problem. Discrete Applied Mathematic, 58(2) (1995) 191\u2013211","journal-title":"Discrete Applied Mathematic"},{"issue":"3","key":"19_CR26","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1287\/ijoc.8.3.302","volume":"8","author":"R. J. M. Vaessens","year":"1996","unstructured":"Vaessens, R. J. M., Aarts, E. H. L., Lenstra, J. K.: Job shop scheduling by local search. INFORMS Journal on Computing, 8(3) (1996) 302\u2013317","journal-title":"INFORMS Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44867-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T19:49:23Z","timestamp":1551124163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44867-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540402053","9783540448679"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-44867-5_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}