TITLE

ONLINE SCHEDULING ON MULTIPLE RESOURCE UNDER STOCHASTIC CONDITIONS

AUTHOR(S)
THOMAS, MICHAEL; SZCZERBICKA, HELENA
PUB. DATE
June 2007
SOURCE
Systems Science;2007, Vol. 33 Issue 2, p23
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Online scheduling (also known as dynamic scheduling) refers to a real-time coordination of operation processing while new operations are continuously arriving. Despite the attention this area received over last years, little effort has been spent on cases where multiple resources arc required for an operation to be processed. The objective of this paper is the study of different online scheduling techniques specifically in a dynamic, stochastic job shop scheduling with multiple resources. We adopt algorithms for dispatching and optimizing schedulers to this case and provide a quantitative study of their performance under varying stochastic conditions. We also discuss the regret-based algorithm from Bent and Van Hentenryck. While this approach is superior in the case of scheduling single resource, it showed interior performance in our experiments compared to its underlying optimizing scheduler.
ACCESSION #
37836920

 

Related Articles

  • Semi-online Machine Covering on Two Uniform Machines with Known Total Size. Tan, Z.; Cao, S. // Computing;Dec2006, Vol. 78 Issue 4, p369 

    This paper investigates semi-online scheduling problem with known total size on two uniform machines for maximizing the minimum machine completion time. Lower bounds and optimal algorithms for every s≥1 are given, where s is the speed ratio of two machines. Both the overall competitive...

  • Applying an Architecture for General Intelligence to Reduce Scheduling Effort. Prietula, Michael J.; Hsu, Wen-Ling; Steier, David; Newell, Allen // ORSA Journal on Computing;Summer93, Vol. 5 Issue 3, p304 

    A system called Merle-Soar is described which demonstrates how a specific architecture for general intelligence and learning (Soar) can be used to reduce scheduling effort when solving simple scheduling problems. In particular, we describe how Merle-Soar schedules sequences of jobs on a single...

  • Minimizing the stretch when scheduling flows of divisible requests. Arnaud Legrand; Alan Su; Frédéric Vivien // Journal of Scheduling;Oct2008, Vol. 11 Issue 5, p381 

    Abstract  In this paper, we consider the problem of scheduling distributed biological sequence comparison applications. This problem lies in the divisible load framework with negligible communication costs. Thus far, very few results have been proposed for this model. We discuss...

  • Semi-online two-level supply chain scheduling problems. Averbakh, Igor; Baysan, Mehmet // Journal of Scheduling;Jun2012, Vol. 15 Issue 3, p381 

    We consider two-level supply chain scheduling problems where customers release jobs to a manufacturer that has to process the jobs and deliver them to the customers. Processed jobs are grouped into batches, which are delivered to the customers as single shipments. The objective is to minimize...

  • On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time. Ng, C.; Lu, Lingfa // Journal of Scheduling;Jun2012, Vol. 15 Issue 3, p391 

    In this paper, we consider the on-line integrated production and outbound distribution scheduling problem to minimize the maximum delivery completion time. All jobs arrive over time, and each job and its processing time become known at its arrival time. The jobs are first processed on a single...

  • Preemptive Semi–online Algorithms for Parallel Machine Scheduling with Known Total Size. Yong He; Hao Zhou; Yi Wei Jiang // Acta Mathematica Sinica;Apr2006, Vol. 22 Issue 2, p587 

    This paper investigates preemptive semi-online scheduling problems on m identical parallel machines, where the total size of all jobs is known in advance. The goal is to minimize the maximum machine completion time or maximize the minimum machine completion time. For the first objective, we...

  • TWO-MACHINE SCHEDULING WITH PERIODIC AVAILABILITY CONSTRAINTS TO MINIMIZE MAKESPAN. Ganggang Li; Xiwen Lu // Journal of Industrial & Management Optimization;Apr2015, Vol. 11 Issue 2, p685 

    A two-machine scheduling problem where one machine has periodic availability constraints has been studied. The objective is to minimize makepan. For the nonresumable version, we give a better approximation algorithm with performance ratio of 4/3. For the resumable version, we provide an offline...

  • Improved Rejection Penalty Algorithm with Multiprocessor Rejection Technique. Satpathy, Prativa; Das, Kalyan; Padhi, Jagmohan // International Journal of Electrical & Computer Engineering (2088;Jun2015, Vol. 5 Issue 3, p477 

    This paper deals with multiprocessor scheduling with rejection technique where each job is provided with processing time and a given penalty cost. If the job satisfies the acceptance condition, it will schedule in the least loaded identical parallel machine else job is rejected. In this way its...

  • Online Strategy for Scheduling A Reservoir for Sudden Water Pollution in Downstream Channel. Hai Ru; Feng Gao; Yinfeng Xu; Xiaohong Guan; Nan Gao // International Journal of Applied Environmental Sciences;2013, Vol. 8 Issue 17, p2221 

    This paper explores the scheduling problem of reservoir during the sudden water pollution happened in downstream channel when the pollution source duration is hard to predicted. Specifically, how to regulate the water release during the pollution accident to decreases the total loss from the...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics