Similar Search Results

Selected combinatorial problems of computational biology

Blazewicz, Jacek; Formanowicz, Piotr; Kasprzak, Marta - In: European journal of operational research : EJOR 161 (2005) 3, pp. 585-597

Persistent link: https://ebvufind01.dmz1.zbw.eu/10006641816

An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints

Sadfi, Cherif; Penz, Bernard; Rapine, Christophe; … - In: European journal of operational research : EJOR 161 (2005) 1, pp. 3-10

Persistent link: https://ebvufind01.dmz1.zbw.eu/10006641837

Two-machine flow shops with limited machine availability

Kubiak, Wieslxlaw; Blxlaz ewicz, Jacek; Formanowicz, Piotr - In: European journal of operational research : EJOR 136 (2002) 3, pp. 528-540

Persistent link: https://ebvufind01.dmz1.zbw.eu/10006656068

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://ebvufind01.dmz1.zbw.eu/10005333929