Optimal preemptive scheduling on uniform machines with discounted flowtime objectives
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Michael H. Rothkopf, 1966. "Scheduling Independent Tasks on Parallel Processors," Management Science, INFORMS, vol. 12(5), pages 437-447, January.
- Michael H. Rothkopf & Stephen A. Smith, 1984. "Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs," Operations Research, INFORMS, vol. 32(2), pages 451-456, April.
- S. Thomas McCormick & Michael L. Pinedo, 1995. "Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis," INFORMS Journal on Computing, INFORMS, vol. 7(1), pages 63-77, February.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Lushchakova, Irina N., 2012. "Preemptive scheduling of two uniform parallel machines to minimize total tardiness," European Journal of Operational Research, Elsevier, vol. 219(1), pages 27-33.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Xiaoqiang Cai & Xiaoqian Sun & Xian Zhou, 2004. "Stochastic scheduling subject to machine breakdowns: The preemptive‐repeat model with discounted reward and other criteria," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(6), pages 800-817, September.
- Szmerekovsky, Joseph G., 2007. "Single machine scheduling under market uncertainty," European Journal of Operational Research, Elsevier, vol. 177(1), pages 163-175, February.
- Bertsimas, Dimitris., 1995. "The achievable region method in the optimal control of queueing systems : formulations, bounds and policies," Working papers 3837-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
- Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
- Huynh Tuong, Nguyen & Soukhal, Ameur & Billaut, Jean-Charles, 2010. "A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines," European Journal of Operational Research, Elsevier, vol. 202(3), pages 646-653, May.
- Ji, Min & He, Yong & Cheng, T.C.E., 2007. "Batch delivery scheduling with batch delivery cost on a single machine," European Journal of Operational Research, Elsevier, vol. 176(2), pages 745-755, January.
- Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "An Introduction To Multiprocessor Scheduling," Econometric Institute Archives 272258, Erasmus University Rotterdam.
- Ji-Bo Wang & Ming-Zheng Wang, 2011. "Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects," Annals of Operations Research, Springer, vol. 191(1), pages 155-169, November.
- Li, Gang & Wang, Xiao-Yuan & Wang, Ji-Bo & Sun, Lin-Yan, 2013. "Worst case analysis of flow shop scheduling problems with a time-dependent learning effect," International Journal of Production Economics, Elsevier, vol. 142(1), pages 98-104.
- Sergei Chubanov & Erwin Pesch, 2009. "Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 70(2), pages 313-335, October.
- Hesaraki, Alireza F. & Dellaert, Nico P. & de Kok, Ton, 2019. "Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan," European Journal of Operational Research, Elsevier, vol. 275(1), pages 304-318.
- José Niño-Mora, 2000. "Beyond Smith's rule: An optimal dynamic index, rule for single machine stochastic scheduling with convex holding costs," Economics Working Papers 514, Department of Economics and Business, Universitat Pompeu Fabra.
- C.A. Glass & C.N. Potts & V.A. Strusevich, 2001. "Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops," INFORMS Journal on Computing, INFORMS, vol. 13(2), pages 120-137, May.
- Schouten, Jop, 2022. "Cooperation, allocation and strategy in interactive decision-making," Other publications TiSEM d5d41448-8033-4f6b-8ec0-c, Tilburg University, School of Economics and Management.
- Robbert Fokkink & Thomas Lidbetter & László A. Végh, 2019. "On Submodular Search and Machine Scheduling," Management Science, INFORMS, vol. 44(4), pages 1431-1449, November.
- Cheng, T. C. Edwin & Shakhlevich, Natalia V., 2005. "Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 165(2), pages 444-456, September.
- Schouten, Jop & Saavedra-Nieves, Alejandro & Fiestras-Janeiro, G., 2020. "Sequencing Situations and Games with Non-Linear Cost Functions," Other publications TiSEM 3e1db5c9-0f77-4f91-a075-c, Tilburg University, School of Economics and Management.
- Chun, Young H., 1999. "Selecting the best choice in the full information group interview problem," European Journal of Operational Research, Elsevier, vol. 119(3), pages 635-651, December.
- Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
- Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:177:y:2007:i:1:p:630-637. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.