Search Results - subject:"Controllable processing times"

Project scheduling with processing time compression cost and lateness penalties

Choi, Byung-Cheon; Briskorn, Dirk - 2010

We consider a project scheduling problem where the precedence constraints graph is an out-tree. The processing times can be compressed by using additional resources, which causes cost and simultaneously reduces the processing times of jobs. The objective is to minimize the sum of total lateness...

Persistent link: https://www.econbiz.de/10011558722

Stochastic lot sizing problem with controllable processing times

Koca, Esra; Yaman, Hande; Selim Aktürk, M. - In: Omega 53 (2015) C, pp. 1-10

In this study, we consider the stochastic capacitated lot sizing problem with controllable processing times where … of controllable processing times becomes more evident for a stochastic environment with a limited capacity. Moreover, we … observe that controllable processing times increase the solution flexibility and provide a better solution in most of the …

Persistent link: https://www.econbiz.de/10011209184

Stochastic lot sizing problem with controllable processing times

Koca, Esra; Yaman, Hande; Aktürk, M. Selim - In: Omega : the international journal of management science 53 (2015), pp. 1-10

Persistent link: https://www.econbiz.de/10010506288

Rescheduling with controllable processing times for number of disrupted jobs and manufacturing cost objectives

Gürel, S.; Cincioglu, D. - In: International journal of production research 53 (2015) 9, pp. 2751-2770

Persistent link: https://www.econbiz.de/10011312268

Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times

Giglio, Davide - In: Journal of scheduling 18 (2015) 5, pp. 525-543

Persistent link: https://www.econbiz.de/10011374190

Batch scheduling of identical jobs with controllable processing times

Mor, Baruch; Mosheiov, Gur - In: Computers & operations research : and their … 41 (2014), pp. 115-124

Persistent link: https://www.econbiz.de/10010222702

Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times

Kayvanfar, Vahid; Komaki, GH. M.; Aalaei, Amin; Zandieh, M. - In: Computers & operations research : and their … 41 (2014), pp. 31-43

Persistent link: https://www.econbiz.de/10010222726

Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time

Yin, Yunqiang; Cheng, T. C. E.; Wu, C.-C.; Cheng, S.-R. - In: Journal of the Operational Research Society : OR 65 (2014) 1, pp. 1-13

Persistent link: https://www.econbiz.de/10010251738

Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product

Kellerer, Hans; Strusevich, Vitaly - In: European Journal of Operational Research 228 (2013) 1, pp. 24-32

scheduling problems are reported: minimizing the total weighted flow time with controllable processing times, minimizing the …

Persistent link: https://www.econbiz.de/10010871213

A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system

Shabtay, Dvir; Bensoussan, Yaron; Kaspi, Moshe - In: International Journal of Production Economics 136 (2012) 1, pp. 67-74

We analyze a two-machine flow-shop scheduling problem in which the job processing times are controllable by the allocation of resources to the job operations and the resources can be used in discrete quantities. We provide a bicriteria analysis of the problem where the first criterion is to...

Persistent link: https://www.econbiz.de/10010572555