Loading...
Please wait, while we are loading the content...
Similar Documents
Logic-based Benders Decomposition for preemptive Flexible Job-Shop Scheduling
| Content Provider | Hyper Articles en Ligne (HAL) |
|---|---|
| Author | Juvin, Carla Houssin, Laurent Lopez, Pierre |
| Copyright Year | 2022 |
| Abstract | In this paper, we address the preemptive flexible job-shop scheduling problem (pFJSSP). We propose three exact methods to solve the pFJSSP with makespan minimization objective: a Mixed Integer Linear Programming (MILP) formulation, a Constraint Programming (CP) formulation, and a Logic-Based Benders Decomposition (LBBD) algorithm. |
| Related Links | https://laas.hal.science/hal-03607646/file/PMS2022-JuvinHoussinLopez.pdf |
| Conference Proceedings | 18th International Conference on Project Management and Scheduling (PMS 2022) |
| Language | English |
| Publisher | HAL CCSD |
| Publisher Date | 2022-04-01 |
| Access Restriction | Open |
| Subject Keyword | Flexible job-shop scheduling Preemption Benders decomposition |
| Content Type | Text |
| Resource Type | Conference Proceedings |
| Subject | Computer Science |