Search
Now showing items 1-10 of 16
Bounding strategies for the hybrid flow shop scheduling problem
(Elsevier, 2011-07-01)
In this paper, we investigate new lower and upper bounds for the multiple-center hybrid flow shop scheduling problem. We propose a family of center-based lower bounds as well as a destructive lower bound that is based on ...
Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search
(Elsevier, 2011-03)
This paper investigates how to adapt a discrepancy-based search method to solve two-stage hybrid flowshop scheduling problems in which each stage consists of several identical machines operating in parallel. The objective ...
OPLINQ: opportunistic link scheduling for massive device-to-device mmWave communication networks
(2017-01)
mmWave communications networking is a promising physical layer technology for the requirement of the huge bandwidth in next generation 5G infrastructures. One of the emerging important applications for 5G mmWave architectures ...
Approximation algorithms for single machine scheduling with one unavailability period
(Springer Nature, 2009-03)
In this paper, we investigate the single machine scheduling problem with release dates and tails and a planned unavailability time period. We show that the problem admits a fully polynomial-time approximation scheme when ...
Stochastic scheduling of operating rooms and reusable medical devices: a simulation optimization approach
(2019-08-08)
Health care expenditures are expected to grow every year, and more than 40% of a hospital's total expenses and revenues are generated by surgical surgeries. One of the major resources required during surgeries are reusable ...
Energetic reasoning revisited: application to parallel machine scheduling
(Springer Science+Business Media, 2008-08)
We consider the problem of minimizing makespan on identical parallel machines subject to release dates and delivery times. We present several new feasibility tests and adjustment techniques that consistently improve ...
Exact approaches for the no wait flowshop problem
(2019-06-11)
In this study, no wait flow shop problem, which is a variant of permutation flow shop, is investigated. In a no wait flow shop, after processing of a job is started, it must be processed completely without any delay or ...
Discrepancy search for the flexible job shop scheduling problem
(Elsevier, 2010-12)
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim ...
Application-based scheduling for indoor femtocell networks
(2013-01)
This thesis is concerned with designing a QoS-enabled, application-based scheduler for indoor femtocell networks. For this purpose, a novel scheduler is proposed which takes into account the quality of service (QoS) ...
Share this page