Narrow search
Showing 1 - 8 of 8
Cover Image
Unified matrix approach to solve production-maintenance problems on a single machine
Finke, Gerd; Gara-Ali, Ahmed; Espinouse, Marie-Laure; … - In: Omega : the international journal of management science 66 (2017), pp. 140-146
Persistent link: https://www.econbiz.de/10011599247
Cover Image
Tabu search for DNA sequencing with false negatives and false positives
Blazewicz, J.; Formanowicz, P.; Kasprzak, M.; … - In: European Journal of Operational Research 125 (2000) 2, pp. 257-265
Persistent link: https://www.econbiz.de/10005347033
Cover Image
Recent advances in scheduling in computer and manufacturing systems
Blazewicz, J.; Ecker, K.; Trystram, D. - In: European Journal of Operational Research 164 (2005) 3, pp. 573-574
Persistent link: https://www.econbiz.de/10005151966
Cover Image
Optimization aspects of deadlock prevention in packet-switching networks
Blazewicz, J.; Brzezinski, J.; Gambosi, G. - In: European Journal of Operational Research 57 (1992) 1, pp. 1-12
Persistent link: https://www.econbiz.de/10005240613
Cover Image
Scheduling tasks on two processors with deadlines and additional resources
Blazewicz, J.; Barcelo, J.; Kubiak, W.; Rock, H. - In: European Journal of Operational Research 26 (1986) 3, pp. 364-370
Persistent link: https://www.econbiz.de/10005253402
Cover Image
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
Cover Image
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
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/10010759266
Cover Image
Handbuch Airlinemanagement
Schmidt, G. - 2018 - Reprint 2018
Persistent link: https://www.econbiz.de/10014508233