Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
From MaRDI portal
Publication:322692
DOI10.1016/J.EJOR.2015.11.036zbMATH Open1346.90340OpenAlexW2188365787MaRDI QIDQ322692FDOQ322692
Rasul Esmaeilbeigi, Hadi Charkhgard, Parisa Charkhgard
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.11.036
Cites Work
- Title not available (Why is that?)
- Separation algorithms for 0-1 knapsack polytopes
- Integer-programming software systems
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Order acceptance using genetic algorithms
- Selecting jobs for heavily loaded shop with lateness penalties
- Improving Discrete Model Representations via Symmetry Considerations
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- Order acceptance with weighted tardiness
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- Job selection in a heavily loaded shop
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
- Computational testing of a separation procedure for the knapsack set with a single continuous variable
- Symmetry in Integer Linear Programming
Cited In (6)
- New formulations for the setup assembly line balancing and scheduling problem
- The type E simple assembly line balancing problem: a mixed integer linear programming formulation
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- The multiphase course timetabling problem
- A matheuristic for the generalized order acceptance and scheduling problem
- Integrated order acceptance and scheduling decision making in product service supply chain with hard time windows constraints
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Two-machine flow-shop scheduling with rejection π π
- New results on two-machine flow-shop scheduling with rejection π π
- Outsourcing and scheduling for two-machine ordered flow shop scheduling problems π π
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint π π
- Order acceptance and scheduling with machine availability constraints π π
- Order acceptance and two parallel machines scheduling problem with an availability constraint π π
- Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates π π
- Two-machine flow shop scheduling problems with minimal and maximal delays π π
This page was built for publication: Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322692)