|
|
|
|
comparing mixed-integer and constraint programming for the no-wait flow shop problem with due date constraints
|
|
|
|
|
|
|
|
نویسنده
|
samarghandi hamed ,firouzi jahantigh farzad
|
|
منبع
|
journal of quality engineering and production optimization - 2019 - دوره : 4 - شماره : 1 - صفحه:17 -24
|
|
چکیده
|
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. for this reason, they should be completed by specific dates or deadlines. in this regard, the efficiency of the models was evaluated based on makespan. to solve the np-hard problem, we developed two mathematical models. once we solved our problem using mixed-integer programming model (henceforth mipm) and then, we applied a constraint programming model (cpm); finally, we compared the optimality of the presented results.
|
|
کلیدواژه
|
constraint programming model ,flow shop scheduling ,makespan ,mixed-integer programming model ,specific deadlines
|
|
آدرس
|
university of saskatchewan, edwards school of business, department of finance and management science, canada, university of sistan and baluchestanuniversity, department of industrial engineeringuniversity of sistan and baluchestan zahedan, department of industrial engineering, iran
|
|
پست الکترونیکی
|
farzadfirouzi@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|