Online scheduling with multi‐state machines
© 2017 Wiley Periodicals, Inc. In this paper, we propose a general framework for online scheduling problems in which each machine has multiple states that lead to different processing times. For these problems, in addition to deciding how to assign jobs to machines, we also need to set the states of...
Main Authors: | Hwang, Dawsen, Jaillet, Patrick |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
Wiley
2021
|
Online Access: | https://hdl.handle.net/1721.1/133473 |
Similar Items
-
Competitive ratios for online multi-capacity ridesharing
by: Lowalekar, M, et al.
Published: (2021) -
Edge Weighted Online Windowed Matching
by: Burq, Maximilien, et al.
Published: (2021) -
Yard Crane Scheduling for container storage, retrieval, and relocation
by: Galle, Virgile, et al.
Published: (2021) -
Yard Crane Scheduling for container storage, retrieval, and relocation
by: Galle, Virgile, et al.
Published: (2022) -
Online Traveling Salesman Problems with Service Flexibility
by: Jaillet, Patrick, et al.
Published: (2011)