Search w/in this Title for Titles All Reviews
	Journal of Scheduling John Wiley & Sons, Ltd.         Options: Date Reviewed Title Author Publisher Published Date Descending Order Ascending Order     1-10 of 11 reviews Date Reviewed     A solution approach based on Benders decomposition for the preventive maintenance scheduling problem of a stochastic large-scale energy system Lusby R., Muller L., Petersen B. Journal of Scheduling 16(6): 605-628, 2013.  Type: Article The 2010 challenge problem from the French Operations Research Society (FORS) required participants to determine a minimum-cost production and maintenance schedule for a group of power plants, leading to a mixed-integer programming pro... Feb 21 2014   A distributed scheduler for air traffic flow management Landry S., Farley T., Hoang T., Stein B. Journal of Scheduling 15(5): 537-551, 2012.  Type: Article Landry et al. describe a distributed system for scheduling air traffic. The system is greedy, so it does not produce an optimal solution, but it is flexible and operates in near real time, which is important given the application domai... Apr 4 2013   Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays Benabid A., Hanen C. Journal of Scheduling 14(5): 511-522, 2011.  Type: Article Scheduling algorithms are infiltrating all aspects of life, as I recently found out when trying to order a dishwasher to be delivered on a particular date. (The retailer’s vehicle scheduling and route planning algorithm said ... May 14 2012   Case studies of successful train crew scheduling optimisation Kwan R. Journal of Scheduling 14(5): 423-434, 2011.  Type: Article Scheduling crews for rail line operations is a difficult (nondeterministic polynomial-time (NP) hard) problem to solve considering the limited resources available and the many considerations imposed on the problem, mainly of a regulato... May 14 2012   A water-flow algorithm for flexible flow shop scheduling with intermediate buffers Tran T., Ng K. Journal of Scheduling 14(5): 483-500, 2011.  Type: Article The title of this paper does not hint at the cleverness of the research described. Tran and Ng study the traditional industrial engineering challenge of how to best schedule jobs (often processed in parallel) when there are several ste... May 9 2012   A comparison of five heuristics for the multiple depot vehicle scheduling problem Pepin A., Desaulniers G., Hertz A., Huisman D. Journal of Scheduling 12(1): 17-30, 2009.  Type: Article The authors compare five heuristics for the multiple depot vehicle scheduling problem of determining the least cost schedule for vehicles assigned to several depots, such that each timetabled task is accomplished exactly once by each v... Jun 4 2009   A computational study of a cutting plane algorithm for university course timetabling Avella P., Vasil’Ev I. Journal of Scheduling 8(6): 497-514, 2005.  Type: Article Timetabling and scheduling problems occur in a variety of contexts, including university course schedules. According to this advanced paper, “given a set of courses, a set of teachers, a set of ... groups of students attendin... Jul 17 2006   Predictive, stochastic and dynamic extensions to aversion dynamics scheduling Black G., McKay K., Messimer S. Journal of Scheduling 7(4): 277-292, 2004.  Type: Article Averse-2, which uses aversion dynamics, adds real-world dynamics to the heuristic Averse-1, which anticipates future risky events by altering its schedule, and thereby mitigating risks. A claim is made that “by utilizing Aver... Feb 11 2005   Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem Bach E., Boyar J., Epstein L., Favrholdt L., Jiang T., Larsen K., Lin G., Van Stee R. Journal of Scheduling 6(2): 131-147, 2003.  Type: Article Given seats and stations, and assuming that is not less than the number of passengers, the seat reservation problem seeks to determine an online seat allocation scheme that maximizes ticket revenue, where every ticket has the same p... Dec 21 2004   Performance bounds of algorithms for scheduling advertisements on a Web page Dawande M., Kumar S., Sriskandarajah C. Journal of Scheduling 6(4): 373-393, 2003.  Type: Article Consider a set of n advertisements (called ads) A=A1, A2, ... , An, competing to be placed in a planning ho... Nov 12 2004       Display 510152550100 per column
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy