Narrow search
Showing 1 - 10 of 696
Cover Image
A column generation approach for solving the patient admission scheduling problem
Range, Troels Martin; Lusby, Richard Martin; Larsen, Jesper - In: European Journal of Operational Research 235 (2014) 1, pp. 252-264
This paper addresses the Patient Admission Scheduling (PAS) problem. The PAS problem entails assigning elective …
Persistent link: https://www.econbiz.de/10010744206
Cover Image
Combining Column Generation and Lagrangian Relaxation
Huisman, D.; Jans, R.F.; Peeters, M.; Wagelmans, A.P.M. - Erasmus Research Institute of Management (ERIM), ERIM … - 2003
algorithms with an application in Lot-sizing. To show the wide applicability of these techniques, we also discuss applications in … integrated vehicle and crew scheduling, plant location and cutting stock problems. …
Persistent link: https://www.econbiz.de/10005288822
Cover Image
Combining Column Generation and Lagrangian Relaxation
Huisman, Dennis; Jans, Jans, R.F.; Peeters, Peeters, M.; … - Erasmus Research Institute of Management (ERIM), … - 2003
algorithms with an application in Lot-sizing. To show the wide applicability of these techniques, we also discuss applications in … integrated vehicle and crew scheduling, plant location and cutting stock problems. …
Persistent link: https://www.econbiz.de/10010837615
Cover Image
Globally Optimal Clusterwise Regression By Column Generation Enhanced with Heuristics, Sequencing and Ending Subset Optimization
Carbonneau, Réal; Caporossi, Gilles; Hansen, Pierre - In: Journal of Classification 31 (2014) 2, pp. 219-241
A column generation based approach is proposed for solving the cluster-wise regression problem. The proposed strategy relies firstly on several efficient heuristic strategies to insert columns into the restricted master problem. If these heuristics fail to identify an improving column, an...
Persistent link: https://www.econbiz.de/10010950401
Cover Image
A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages
Figielska, Ewa - In: European Journal of Operational Research 236 (2014) 2, pp. 433-444
In this paper we propose a heuristic for solving the problem of resource constrained preemptive scheduling in the two … preemptive scheduling problem at stage 2. Priority rules which depend on processing times and resource requirements of jobs are …
Persistent link: https://www.econbiz.de/10010753509
Cover Image
Daily Aircraft Routing and Scheduling
Desaulniers, Guy; Desrosiers, Jacques; Dumas, Yvan; … - In: Management Science 43 (1997) 6, pp. 841-855
In this paper we consider the daily aircraft routing and scheduling problem (DARSP). It consists of determining daily …
Persistent link: https://www.econbiz.de/10009208769
Cover Image
Long term staff scheduling of physicians with different experience levels in hospitals using column generation
Brunner, Jens; Edenharter, Günther - In: Health Care Management Science 14 (2011) 2, pp. 189-202
Persistent link: https://www.econbiz.de/10009150375
Cover Image
Scheduling linear deteriorating jobs to minimize the number of tardy jobs
Jafari, Abbasali; Moslehi, Ghasem - In: Journal of Global Optimization 54 (2012) 2, pp. 389-404
In this paper a problem of scheduling a single machine under linear deterioration which aims at minimizing the number …
Persistent link: https://www.econbiz.de/10010994001
Cover Image
Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
Mensendiek, Arne; Gupta, Jatinder N.D.; Herrmann, Jan - In: European Journal of Operational Research 243 (2015) 2, pp. 514-522
parallel machines where jobs can only be delivered at certain fixed delivery dates. Scheduling problems with fixed delivery …
Persistent link: https://www.econbiz.de/10011209377
Cover Image
A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time
Potts, C. N. - In: Management Science 31 (1985) 10, pp. 1300-1311
The single machine sequencing problem is considered in which there are precedence constraints on the jobs. The objective is to minimize the sum of weighted completion times. A lower bound is obtained by successively performing a Lagrangean relaxation of appropriate constraints. Each Lagrange...
Persistent link: https://www.econbiz.de/10009214591