{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T04:58:22Z","timestamp":1773723502567,"version":"3.50.1"},"reference-count":23,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":9263,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1981,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The set partitioning model of the crew rotation problem has been well known for many years. This paper focuses on recent developments that have made this model more attractive and have resulted in several successful implementations. These developments include improved problem conceptualizations and decompositions, as well as new solution techniques employing Lagrangian relaxation and subgradient optimization. Experience is reported from The Flying Tiger Line, Pacific Southwest Airways, Continental Airlines, and Helsinki City Transport. A case is made for work on heuristic decomposition methods to break large problems into moderate sized pieces that can be solved exactly.<\/jats:p>","DOI":"10.1002\/net.3230110208","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T12:00:30Z","timestamp":1178884830000},"page":"165-177","source":"Crossref","is-referenced-by-count":87,"title":["Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications"],"prefix":"10.1002","volume":"11","author":[{"given":"Roy E.","family":"Marsten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Shepardson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.3.2.140"},{"key":"e_1_2_1_3_2","volume-title":"TRIP Computer Program","author":"Cukier A."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.25.5.760"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120699"},{"key":"e_1_2_1_6_2","volume-title":"Perspectives on Optimization","author":"Garfinkel R. S.","year":"1972"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.5.848"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120690"},{"key":"e_1_2_1_9_2","unstructured":"R.Gerbracht CAPS Computer Program Continental Airlines 7300 World Way West International Airport Los Angeles CA 90009."},{"key":"e_1_2_1_10_2","unstructured":"R.Gerbracht \u201cA New Algorithm for Very Large Crew Pairing Problems\u201d 18th AGIFORS Symposium Vancouver British Columbia Canada September 1978."},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584070"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580223"},{"key":"e_1_2_1_13_2","unstructured":"S.KoljonenandM.Tamminen \u201cBus Crew Scheduling at Helsinki City Transport\u201d presented at theNordic Operations Analysis Conference(NOAK 77) October 1977."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.19.4.998"},{"key":"e_1_2_1_15_2","unstructured":"A.Maimon ASPS Computer Program Boeing Computer Services Company 505 Baker Blvd. Seattle WA 98188."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.20.5.774"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.25.12.1175"},{"key":"e_1_2_1_18_2","unstructured":"M. R.Muller BIDGEN Computer Program The Flying Tiger Line 7401 World Way West International Airport Los Angeles CA 90009."},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.15.3.191"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.19.5.528"},{"key":"e_1_2_1_21_2","unstructured":"J. K.Reid \u201cFORTRAN Subroutines for Handling Sparse Linear Programming Bases\u201d Report AERE\u2010R8269 Computer Science and Systems Division AERE Harwell Oxfordshire England January 1976."},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.26.3.274"},{"key":"e_1_2_1_23_2","unstructured":"M.Spitzer \u201cSolution to the Crew Scheduling Problem\u201d presented at theFirst AGIFORS Symposium October 1961."},{"key":"e_1_2_1_24_2","doi-asserted-by":"crossref","unstructured":"E. K.Baker L. D.Bodin W. F.Finnegan andR. J.Ponder \u201cEfficient Heuristic Solutions to an Airline Crew Scheduling Problem\u201d AIIE Trans. 79\u201385(1979).","DOI":"10.1080\/05695557908974446"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230110208","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230110208","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T11:41:40Z","timestamp":1699789300000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230110208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["10.1002\/net.3230110208"],"URL":"https:\/\/doi.org\/10.1002\/net.3230110208","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}