Constraint programing for solving four complex flexible shop scheduling problems
Abstract In recent years, with the advent of robust solvers such as Cplex and Gurobi, constraint programing (CP) has been widely applied to a variety of scheduling problems. This paper presents CP models for formulating four scheduling problems with minimal makespan and complex constraints: the no‐w...
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-06-01
|
| Series: | IET Collaborative Intelligent Manufacturing |
| Online Access: | https://doi.org/10.1049/cim2.12005 |