Narrow search
Showing 1 - 10 of 1,744
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 : EJOR 235 (2014) 1, pp. 252-264
Persistent link: https://www.econbiz.de/10010361346
Cover Image
A new approach for solving capacitated lot sizing and scheduling problem with sequence and period-dependent setup costs
Memmi, Imen Chaieb; Laaroussi, Sondes Hammami - In: Journal of industrial engineering and management : JIEM 6 (2013) 4, pp. 1027-1054
time period, their economic amounts, and their scheduling within each period. This outcome should help decision makers …
Persistent link: https://www.econbiz.de/10011903343
Cover Image
A new type of model for multi-item capacitated dynamic lotsizing and scheduling
Drexl, Andreas; Haase, Knut - 1992
Three types of multi-item capacitated dynamic lotsizing and scheduling models are well established until now: The … capacitated lotsizing problem, the discrete lotsizing and scheduling problem as well as the continuous setup lotsizing problem. An … lotsizing and scheduling problem. This model type is well suited for incorporating some of the extensions relevant with respect …
Persistent link: https://www.econbiz.de/10011738009
Cover Image
Parallel machine scheduling with limited controllable machine availability
Dong, Ming - In: International journal of production research 51 (2013) 8, pp. 2240-2252
Persistent link: https://www.econbiz.de/10009731495
Cover Image
A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint
Lee, Ju-Yong; Kim, Yeong-Dae - In: Journal of the Operational Research Society : OR 66 (2015) 9, pp. 1542-1554
Persistent link: https://www.econbiz.de/10011417478
Cover Image
A binary branch and bound algorithm to minimize maximum scheduling cost
Chandra, Charu; Liu, Zhixin; He, Jun; Ruohonen, Toni - In: Omega : the international journal of management science 42 (2014), pp. 9-15
Persistent link: https://www.econbiz.de/10010204531
Cover Image
An exact algorithm to minimize mean squared deviation of job completion times about a common due date
Srirangacharyulu, B.; Srinivasan, G. - In: European journal of operational research : EJOR 231 (2013) 3, pp. 547-556
Persistent link: https://www.econbiz.de/10009787396
Cover Image
A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
Neto, Teresa; Constantino, Miguel Fragoso; Martins, Isabel - In: International transactions in operational research : … 20 (2013) 5, pp. 689-709
Persistent link: https://www.econbiz.de/10009790939
Cover Image
Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
Mensendiek, Arne; Gupta, Jatinder N.; Herrmann, Jan - In: European journal of operational research : EJOR 243 (2015) 2, pp. 514-522
Persistent link: https://www.econbiz.de/10010510059
Cover Image
A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan
Ozturk, Onur; Begen, Mehmet A.; Zaric, Gregory S. - In: International journal of production research 55 (2017) 5/6, pp. 1815-1831
Persistent link: https://www.econbiz.de/10011628422