Search Results - subject:"availability constraints"

Order acceptance and scheduling with machine availability constraints

Zhong, Xueling; Ou, Jinwen; Wang, Guoqing - In: European journal of operational research : EJOR 232 (2014) 3, pp. 435-441

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

A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints

Detienne, Boris - In: European journal of operational research : EJOR 235 (2014) 3, pp. 540-552

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

On the exact bounds of SPT for scheduling on parallel machines with availability constraints

Tan, Zhiyi; Chen, Yong; Zhang, An - In: International Journal of Production Economics 146 (2013) 1, pp. 293-299

This paper considers the scheduling problems with the objective of minimizing the total completion time on two parallel identical machines with given unavailable periods. The jobs are assumed to be nonresumable. If there is one unavailable period on one of the two machines, we prove that SPT has...

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

On the exact bounds of SPT for scheduling on parallel machines with availability constraints

Tan, Zhiyi; Chen, Yong; Zhang, An - In: International journal of production economics 146 (2013) 1, pp. 293-299

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

Scheduling hybrid flow shop problem with non-fixed availability constraints

Besbes, Walid; Teghem, Jacques; Loukil, Taicir - In: European Journal of Industrial Engineering 4 (2010) 4, pp. 413-433

In this study, we deal with a k-stage hybrid flow shop scheduling problem under availability constraints (HFSPAC). In …

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

Pessan, Cedric; Bouquard, Jean-Louis; Neron, Emmanuel - In: European Journal of Industrial Engineering 2 (2008) 2, pp. 153-171

allows simplifying the problem into an assignment problem, even when we take into consideration the availability constraints …

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

Pessan, Cedric; Bouquard, Jean-Louis; Neron, Emmanuel - In: European Journal of Industrial Engineering 2 (2008) 2, pp. 153-171

allows simplifying the problem into an assignment problem, even when we take into consideration the availability constraints …

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

Non-preemptive two-machine open shop scheduling with non-availability constraints

Breit, J.; Schmidt, G.; Strusevich, V. A. - In: Mathematical Methods of Operations Research 57 (2003) 2, pp. 217-234

We study a two-machine open shop scheduling problem, in which the machines are not continuously available for processing. No preemption is allowed in the processing of any operation. The objective is to minimize the makespan. We consider approximability issues of the problem with more than one...

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

Non-preemptive two-machine open shop scheduling with non-availability constraints

Breit, J.; Schmidt, G.; Strusevich, V. A. - In: Computational Statistics 57 (2003) 2, pp. 217-234

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

Heuristic algorithms for the two-machine flowshop with limited machine availability

Blazewicz, Jacek; Breit, Joachim; Formanowicz, Piotr; … - In: Omega 29 (2001) 6, pp. 599-608

The paper studies a flowshop scheduling problem where machines are not available in given time intervals. The objective is to minimize the makespan. The problem is known to be NP-hard for two machines. We analyze constructive and local search based heuristic algorithms for the two-machine case....

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