Loading…
Order acceptance and scheduling problems in two-machine flow shops: New mixed integer programming formulations
•We consider the order acceptance and scheduling problem in two machine flow shops.•Two new mixed integer linear programming formulations are presented for the problem.•Several techniques are developed to improve each of these formulations.•Larger instances of the problem are solved within a reasona...
Saved in:
Published in: | European journal of operational research 2016-06, Vol.251 (2), p.419-431 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | •We consider the order acceptance and scheduling problem in two machine flow shops.•Two new mixed integer linear programming formulations are presented for the problem.•Several techniques are developed to improve each of these formulations.•Larger instances of the problem are solved within a reasonable amount of time.
We present two new mixed integer programming formulations for the order acceptance and scheduling problem in two machine flow shops. Solving this optimization problem is challenging because two types of decisions must be made simultaneously: which orders to be accepted for processing and how to schedule them. To speed up the solution procedure, we present several techniques such as preprocessing and valid inequalities. An extensive computational study, using different instances, demonstrates the efficacy of the new formulations in comparison to some previous ones found in the relevant literature. |
---|---|
ISSN: | 0377-2217 1872-6860 |
DOI: | 10.1016/j.ejor.2015.11.036 |