{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:37:56Z","timestamp":1759667876238,"version":"3.41.2"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational & Mathematical Organization Theory"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1023\/a:1009637419820","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T17:47:08Z","timestamp":1040579228000},"page":"191-217","source":"Crossref","is-referenced-by-count":32,"title":["Nondominated Schedules for a Job-Shop with Two Competing Users"],"prefix":"10.1007","volume":"6","author":[{"given":"A.","family":"Agnetis","sequence":"first","affiliation":[]},{"given":"P.B.","family":"Mirchandani","sequence":"additional","affiliation":[]},{"given":"D.","family":"Pacciarelli","sequence":"additional","affiliation":[]},{"given":"A.","family":"Pacifici","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"266050_CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1111\/j.1475-3995.1995.tb00004.x","volume":"2","author":"A. Agnetis","year":"1995","unstructured":"Agnetis, A. and G. Oriolo (1995), \u201cThe Machine Duplication Problem in a Job Shop with Two Jobs, \u201d International Transactions on Operational Research, 2(1), 45\u201360.","journal-title":"International Transactions on Operational Research"},{"issue":"4","key":"266050_CR2","first-page":"429","volume":"3","author":"S.B. Akers","year":"1955","unstructured":"Akers, S.B. and J. Friedman (1955), \u201cA Non-Numerical Approach to Production Scheduling Problems, \u201d Operations Research, 3(4), 429\u2013442.","journal-title":"Operations Research"},{"key":"266050_CR3","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"K.R. Baker","year":"1990","unstructured":"Baker, K.R. and G.D. Scudder (1990), \u201cSequencing with Earliness and Lateness Penalties: A Review, \u201d Operations Research, 38, 22\u201336.","journal-title":"Operations Research"},{"key":"266050_CR4","unstructured":"Brewer, P.J. and R.P. Plott (1994), \u201cA Binary Conflict Ascending Price Mechanism for Decentralized Allocation of the Right to Use Railroad Tracks, \u201d Working Paper, Division of Humanities and Social Sciences, California Institute of Technology."},{"key":"266050_CR5","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF02276919","volume":"40","author":"P. Brucker","year":"1988","unstructured":"Brucker, P. (1988), \u201cAn Efficient Algorithm for the Job-Shop Problem with Two Jobs, \u201d Computing, 40, 353\u2013359.","journal-title":"Computing"},{"key":"266050_CR6","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/0305-0548(94)90099-X","volume":"21","author":"X. Cai","year":"1994","unstructured":"Cai, X. and C.J. Goh (1994), \u201cA Fast Heuristic for the Train Scheduling Problem, \u201d Computers and Operations Research, 21, 499\u2013510.","journal-title":"Computers and Operations Research"},{"key":"266050_CR7","doi-asserted-by":"crossref","first-page":"988","DOI":"10.1057\/jors.1995.136","volume":"46","author":"M. Carey","year":"1995","unstructured":"Carey, M. and D. Lockwood (1995), \u201cA Model, Algorithms, and Strategy for Train Pathing, \u201d Journal of Operational Research Society, 46, 988\u20131005.","journal-title":"Journal of Operational Research Society"},{"key":"266050_CR8","volume-title":"Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop","author":"S. French","year":"1982","unstructured":"French, S. (1982), Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop. Ellis Horwood Ltd., Chichester, UK."},{"key":"266050_CR9","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.39.5.836","volume":"5","author":"N.G. Hall","year":"1991","unstructured":"Hall, N.G. and M.E. Posner (1991), \u201cEarliness-Tardiness Scheduling Problems. I: Weighted Deviation of Completion Times about a Common Due Date, \u201d Operations Research, 5, 836\u2013846.","journal-title":"Operations Research"},{"issue":"6","key":"266050_CR10","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1287\/opre.11.6.889","volume":"11","author":"W.W. Hardgrave","year":"1963","unstructured":"Hardgrave, W.W. and G.L. Nemhauser (1963), \u201cA Geometric Model and a Graphical Algorithm for a Sequencing Problem, \u201d Operations Research, 11(6), 889\u2013900.","journal-title":"Operations Research"},{"key":"266050_CR11","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/opre.39.1.82","volume":"39","author":"D. Kraay","year":"1991","unstructured":"Kraay, D., P.T. Harker and B. Chen (1991), \u201cOptimal Pacing of Trains in Freight Railroads: Model Formulation and Solution, \u201d Operations Research, 39, 82\u201399.","journal-title":"Operations Research"},{"key":"266050_CR12","unstructured":"McCabe, K.A., S.J. Rassenti and V.L. Smith (1990), \u201cExperimental Research on Deregulating Natural Gas Pipeline and Electric Power Transmission Networks, \u201d Working Paper, Center for Law and Economic Studies, Columbia University School of Law."},{"key":"266050_CR13","first-page":"145","volume":"25","author":"M. Raghavachari","year":"1988","unstructured":"Raghavachari, M. (1988), \u201cScheduling Problems with Non-regular Penalty Functions-A Review, \u201d Opsearch, 25, 145\u2013164.","journal-title":"Opsearch"},{"key":"266050_CR14","doi-asserted-by":"crossref","unstructured":"Rassenti, S.J., V.L. Smith and R.L. Bulfin (1982), \u201cA Combinatorial Auction Mechanism for Airport Time Slot Allocation, \u201d Bell Journal of Economics, 402\u2013415.","DOI":"10.2307\/3003463"},{"issue":"6","key":"266050_CR15","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1287\/opre.8.6.782","volume":"8","author":"W. Szwarc","year":"1960","unstructured":"Szwarc, W. (1960), \u201cSolution of the Akers-Friedman Scheduling Problem, \u201d Operations Research, 8(6), 782\u2013788.","journal-title":"Operations Research"}],"container-title":["Computational & Mathematical Organization Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009637419820.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009637419820\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009637419820.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:27:23Z","timestamp":1752377243000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009637419820"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["266050"],"URL":"https:\/\/doi.org\/10.1023\/a:1009637419820","relation":{},"ISSN":["1381-298X","1572-9346"],"issn-type":[{"type":"print","value":"1381-298X"},{"type":"electronic","value":"1572-9346"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}