《2016 An Integrated Greedy Heuristic for a Flexible Job Shop Scheduling Problem》.pdf

An Integrated Greedy Heuristic for a Flexible Job Shop SchedulingProblem Yazid Mati, Nidhal Rezg and Xiaolan Xie INRIA / MACS1 Project LGlPM ENIM - ILE DU SAULCY, 57045 Metz, France. Tel: (33)-3-87 34 67 34. Fax: (33)-3-87 34 69 35. E-mail: {ymati, nrezg, xie}@loria.fr Abstract any machine r in a given set pLlkc3.Its processing time pllr depends on the machine r to be selected The job shop scheduling problem (JSP) deals and is known. The operation is non-preemptive,i.e with the sequencing operations of a set ofjobs on a it must be accomplished without interruption. The set of machines with minimum cost. The flexible scheduling problem of a FJSP consists of a routing job shop scheduling problem (FJSP) is a subproblem, that is, assigning each operation to a generalization of the JSP, which is concerned with machine in the related set and the scheduling both the assignment of machines to operations and subproblem, which consists of sequencing the the sequencing of the operations on the assigned assigned operations on each machine in order to machines. This paper first presents an extension of obtain a feasible schedule nlinimizing a given the geometric approach for solving a two-job shop objective function. In this paper, we address the problem, when there is one flexible job and the makespan minimization problem. second job is a job shop job. Based on this Most of the literature o