Research Communication | Open Access
Volume 2021 | Communication ID 105
Volume 2021 | Communication ID 105
| The Job Shop Scheduling Problem |
Lotfi Nohair, Abderrahim Eladraoui, Abdelwahed Namir
Received |
Accepted |
Published |
January 28, 2021 |
February 15, 2021 |
March 15, 2021 |
Abstract: The deterministic Job Shop Scheduling Problem [1], hereinafter referred to as JSSP, consists of a finite set J of n jobs to be processed on a finite set M of m machines. Each job must be processed on every machine and consists of a chain of m operations which have to be scheduled in a predetermined given order [2]. While the family of problems related to Job Shop Scheduling Problem is vast, this communication is limited to the JSSP with the makespan objective function, i.e., J||Cmax in α|β|γ notation [3]. In this communication, we present a mathematical formulation using a disjunctive ...