Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations

DOI10.1016/j.ejor.2015.11.036zbMath1346.90340OpenAlexW2188365787MaRDI QIDQ322692

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

zbMATH Keywords

schedulingmixed integer programmingvalid inequalitiespreprocessingorder acceptance

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (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 ⋮ Integrated order acceptance and scheduling decision making in product service supply chain with hard time windows constraints ⋮ Exact methods for order acceptance and scheduling on unrelated parallel machines ⋮ A matheuristic for the generalized order acceptance and scheduling problem ⋮ The multiphase course timetabling problem

Cites Work

• Unnamed Item
• 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
• Integer-programming software systems
• Order acceptance with weighted tardiness
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• Order acceptance using genetic algorithms
• 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
• Selecting jobs for heavily loaded shop with lateness penalties
• Separation algorithms for 0-1 knapsack polytopes
• Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable
• Improving Discrete Model Representations via Symmetry Considerations
• Symmetry in Integer Linear Programming
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation

This page was built for publication: Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations