Ghaith Rabadi

Learn More
The problem addressed in this paper is the non-preemptive unrelated parallel machine scheduling problem with the objective of minimizing the makespan. Machine-dependent and job sequence-dependent setup times are considered, all jobs are available at time zero, and all times are deterministic. This is a NP-hard problem and in this paper, optimal solutions(More)
In this paper we propose a tabu search implementation to solve the unrelated parallel machines scheduling problem with sequenceand machinedependent setup times to minimize the schedule’s makespan. The problem is NP-hard and finding an optimal solution efficiently is unlikely. Therefore, heuristic techniques are more appropriate to find near-optimal(More)
The problem addressed in this paper is scheduling jobs on unrelated parallel machines with sequence-dependent setup times to minimize the maximum completion time (i.e., the makespan). This problem is NP-hard even without including setup times. Adding sequence-dependent setup times adds another dimension of complexity to the problem and obtaining optimal(More)
0360-8352/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.cie.2011.09.015 q This manuscript was processed by Area Editor Su ⇑ Corresponding author. Tel.: +90 212 663 2490; fa E-mail addresses: skaplan@hho.edu.tr, skaplan@o odu.edu (G. Rabadi). 1 Tel.: +1 757 683 4918; fax: +1 757 683 5640. The Aerial Refueling Scheduling Problem (ARSP) can be defined(More)
The single-machine early/tardy (E/T) scheduling problem is addressed in this research. The objective of this problem is to minimize the total amount of earliness and tardiness. Earliness and tardiness are weighted equally and the due date is common and large (unrestricted) for all jobs. Machine setup time is included and is considered sequence-dependent.(More)
This paper addresses the non-preemptive unrelated parallel machine scheduling problem with machine-dependent and job sequence-dependent setup times. All jobs are available at time zero, all times are deterministic, and the objective is to minimize the makespan. This is a NP-hard problem and in this paper, a two-stage ant colony optimization (ACO) algorithm(More)
Analyzing systems by means of simulation is necessarily a time consuming process. This becomes even more pronounced when models of multiple systems must be compared. In general, and even more so in today’s fast-paced environment, competitive pressure does not allow for waiting on the results of a lengthy analysis. That competitive pressure also makes it(More)