{"product_id":"theoretical-and-computational-research-in-various-scheduling-models-hardcover","title":"Theoretical and Computational Research in Various Scheduling Models - Hardcover","description":"\u003cdiv\u003e\u003cp style=\"text-align: right;\"\u003e\u003ca href=\"https:\/\/reportcopyrightinfringement.com\/\" target=\"_blank\" rel=\"nofollow\"\u003e\u003cb\u003eReport copyright infringement\u003c\/b\u003e\u003c\/a\u003e\u003c\/p\u003e\u003c\/div\u003e\u003cp\u003eby \u003cb\u003eChin-Chia Wu\u003c\/b\u003e (Guest Editor), \u003cb\u003eWin-Chin Lin\u003c\/b\u003e (Guest Editor)\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003eNine manuscripts were published in this Special Issue on \"Theoretical and Computational Research in Various Scheduling Models, 2021\" of the MDPI Mathematics journal, covering a wide range of topics connected to the theory and applications of various scheduling models and their extensions\/generalizations. These topics include a road network maintenance project, cost reduction of the subcontracted resources, a variant of the relocation problem, a network of activities with generally distributed durations through a Markov chain, idea on how to improve the return loading rate problem by integrating the sub-tour reversal approach with the method of the theory of constraints, an extended solution method for optimizing the bi-objective no-idle permutation flowshop scheduling problem, the burn-in (B\/I) procedure, the Pareto-scheduling problem with two competing agents, and three preemptive Pareto-scheduling problems with two competing agents, among others.\u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e\u003cp\u003eWe hope that the book will be of interest to those working in the area of various scheduling problems and provide a bridge to facilitate the interaction between researchers and practitioners in scheduling questions. Although discrete mathematics is a common method to solve scheduling problems, the further development of this method is limited due to the lack of general principles, which poses a major challenge in this research field.\u003c\/p\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003eNumber of Pages:\u003c\/strong\u003e 208\u003c\/div\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003eDimensions:\u003c\/strong\u003e 0.69 x 9.61 x 6.69 IN\u003c\/div\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003ePublication Date:\u003c\/strong\u003e January 29, 2022\u003c\/div\u003e\n            ","brand":"BooksCloud","offers":[{"title":"Default Title","offer_id":53379857809715,"sku":"9783036530185","price":80.62,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0300\/5595\/6612\/files\/dOhEhw1OQz9783036530185.webp?v=1779353565","url":"https:\/\/www.vysn.com\/en-ca\/products\/theoretical-and-computational-research-in-various-scheduling-models-hardcover","provider":"VYSN","version":"1.0","type":"link"}