Narrow search
Showing 1 - 10 of 99
Cover Image
A scheduling problem with three competing agents
Lee, Wen-chiung; Wang, Jen-ya - In: Computers & operations research : and their … 51 (2014), pp. 208-217
Persistent link: https://www.econbiz.de/10010408858
Cover Image
Makespan minimization with OR-precedence constraints
Happach, Felix - In: Journal of Scheduling 24 (2021) 3, pp. 319-328
which it must not start. We prove that a simple List Scheduling algorithm due to Graham (Bell Syst Tech J 45 …
Persistent link: https://www.econbiz.de/10014501648
Cover Image
Optimal algorithms for scheduling under time-of-use tariffs
Chen, Lin; Megow, Nicole; Rischke, Roman; Stougie, Leen; … - In: Annals of Operations Research 304 (2021) 1-2, pp. 85-107
We consider a natural generalization of classical scheduling problems to a setting in which using a time unit for … scheduling cost. We focus on preemptive single-machine scheduling and two classical scheduling cost functions, the sum of … the classical scheduling setting, they are considerably more complex when time-of-use tariffs must be considered. We …
Persistent link: https://www.econbiz.de/10014501748
Cover Image
Multi-Stage assembly flow shop with setup time and release time
Sheikha, Shaya; Komakib, G. M.; Kayvanfarc, Vahid; … - In: Operations Research Perspectives 6 (2019), pp. 1-15
This article addresses multi-stage assembly flow shop for the first time. We propose several industrial applications of this system in which the opening stage has m parallel machines and the following stages (e.g. assembly, transportation, painting, packaging, etc.) complete and prepare products...
Persistent link: https://www.econbiz.de/10012662773
Cover Image
Energy Aware Grid Scheduling for Dependent Task Using Genetic Algorithm
Vidyarthi, Deo Prakash; Prakash, Shiv - In: International Journal of Distributed Systems and … 7 (2016) 2, pp. 18-36
computing platform which consumes enormous energy in the task execution. Energy-aware job scheduling, in the computational grid …
Persistent link: https://www.econbiz.de/10012044162
Cover Image
Energy Efficient Scheduling for Multiple Workflows in Cloud Environment
Garg, Ritu; Shukla, Neha - In: International Journal of Information Technology and Web … 13 (2018) 3, pp. 14-34
scheduling heuristic for multiple workflows running parallel in the cloud environment with the aim to reduce the energy …
Persistent link: https://www.econbiz.de/10012046122
Cover Image
Performance Comparison of Cuckoo Search Algorithm to Solve the Hybrid Flow Shop Scheduling Benchmark Problems with Makespan Criterion
Marichelvam, M.K.; Tosun, Ömür - In: International Journal of Swarm Intelligence Research (IJSIR) 7 (2016) 2, pp. 1-14
) scheduling problems with parallel machines. The objective is the minimization of makespan. The HFS scheduling problems are proved …
Persistent link: https://www.econbiz.de/10012047833
Cover Image
Meta-Heuristics Based Load Balancing Optimization in Cloud Environment on Underflow and Overflow Conditions
Kaur, Amanpreet; Kaur, Bikrampal; Singh, Dheerendra - In: Journal of Information Technology Research (JITR) 11 (2018) 4, pp. 155-172
In cloud environment, the main challenge is load balancing as it requires distributing the load among many various virtual machines (VM) while avoiding underflow and overflow conditions. In this article, the question that which load-balancing (overflow or underflow) management will better...
Persistent link: https://www.econbiz.de/10012049184
Cover Image
Makespan distributions in flow shop scheduling
Caffrey, James; Hitchings, Graham - In: International Journal of Operations & Production Management 15 (1995) 3, pp. 50-58
Concerns scheduling five jobs through a flow shop with five machines. The distribution of makespans and the …
Persistent link: https://www.econbiz.de/10014790548
Cover Image
Job-shop local-search move evaluation without direct consideration of the criterion’s value
Murovec, Boštjan - In: European Journal of Operational Research 241 (2015) 2, pp. 320-329
This article focuses on the evaluation of moves for the local search of the job-shop problem with the makespan criterion. We reason that the omnipresent ranking of moves according to their resulting value of a criterion function makes the local search unnecessarily myopic. Consequently, we...
Persistent link: https://www.econbiz.de/10011077629