Showing 1 - 10 of 15
We consider the two-machine no-wait flow shop problem with separable setup times and single server side constraints, and makespan as the performance measure. This problem is strongly NP-hard. A mathematical model of the problem is developed and a number of propositions are proven for the special...
Persistent link: https://www.econbiz.de/10009352907
Sensors form an effective wireless network for the surveillance of a region. Ensuring coverage is an important issue in wireless sensor network design. This paper focuses on an application where sensors are used to detect intruders. The defender wants to determine the best locations of the...
Persistent link: https://www.econbiz.de/10010722754
This paper deals with online scheduling of a flexible job-shop with blocking where jobs are transported between the machines by one or several automated guided vehicles. The objective is to minimise the total weighted tardiness of the jobs. Schedules have to be generated online (i.e., jobs only...
Persistent link: https://www.econbiz.de/10010667482
metaheuristics for SALBP-1. In this paper, we propose to investigate the link between SALBP-1 and PALBP and to adapt our … metaheuristics for this problem. Two cases are considered. [Received 10 September 2009; Revised 10 June 2010; Accepted 23 November …
Persistent link: https://www.econbiz.de/10011015196
In this paper, an integer quadratic programming model is proposed for workload balancing in the examination job assignment problem. The proposed model can be classified as part of the 'Generalised Assignment Problem' or GAP, which is known as an NP-hard problem. To solve the proposed model, a...
Persistent link: https://www.econbiz.de/10005078485
The broad applications of cellular manufacturing make the cell formation problem (CFP) a core subject in the field of manufacturing. Due to the combinatorial nature of the CFP, a simulated annealing-based meta-heuristic with variable neighbourhood was developed to form part-machine cells. To...
Persistent link: https://www.econbiz.de/10009352902
three state-of-the-art metaheuristics on the same benchmark instances. [Received 26 February 2010; Revised 19 July 2010, 17 …
Persistent link: https://www.econbiz.de/10010667478
In this paper, we analyse the single machine maximum lateness minimisation scheduling problem with the aging effect, where the job processing times are described by non-decreasing functions dependent on the sum of the normal processing times of already processed jobs. We prove that the...
Persistent link: https://www.econbiz.de/10010670134
In this research, a permutation flowshop sequence-dependent group scheduling problem with minimisation of total completion time is considered. Since the problem is shown to be strongly NP-hard, a hybrid genetic (HG) algorithm is proposed. The only available lower bounding (LB) method for the...
Persistent link: https://www.econbiz.de/10010777251
In this paper, we propose an oscillation strategy heuristic combined with mathematical programming for disruption management in the airline industry (DMAI). The goal of this problem is to resume normal operations as quickly as possible during the recovery period while minimising the resulting...
Persistent link: https://www.econbiz.de/10011130263