Narrow search
Showing 1 - 10 of 841
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/10011939092
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/10011653574
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
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 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
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
Cover Image
A tutorial of integrating duality and branch and bound in earliness-tardiness scheduling with idle insertion time problems
Gorman, Michael F.; Conway, Daniel G. - In: International journal of production research 56 (2018) 1/2, pp. 262-277
Persistent link: https://www.econbiz.de/10011876303
Cover Image
Hybrid branch and bound algorithms for the two-stage assembly scheduling problem with separated setup times
Luo, JianChao; Liu, ZhiQiang; Xing, Keyi - In: International journal of production research 57 (2019) 5, pp. 1398-1412
Persistent link: https://www.econbiz.de/10012183815
Cover Image
Integrated production, inventory and delivery problems : complexity and algorithms
Li, Feng; Chen, Zhi-long; Tang, Lixin - In: INFORMS journal on computing : JOC 29 (2017) 2, pp. 232-250
Persistent link: https://www.econbiz.de/10011691149