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

DOI10.1016/J.EJOR.2015.11.036MaRDI QIDQ322692zbMATH OpenOpenAlexFDO

Authors Rasul Esmaeilbeigi, Parisa Charkhgard, Hadi 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

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

Recommendations

• Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
• Order acceptance and two parallel machines scheduling problem with an availability constraint
• New results on two-machine flow-shop scheduling with rejection
• Two-machine flow-shop scheduling with rejection
• Outsourcing and scheduling for two-machine ordered flow shop scheduling problems
• Order acceptance and scheduling with machine availability constraints
• Two-machine flow shop scheduling problems with minimal and maximal delays
• Two-machine flow-shop scheduling problems with minimizing the total completion times
• Two-machine ordered flow shop scheduling with generalized due dates
• Two-machine flow-shop scheduling with deterioration and rejection

Cites work

• scientific article; zbMATH DE number 176470 (Why is no real title available?)
• A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
• Computational testing of a separation procedure for the knapsack set with a single continuous variable
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• Improving Discrete Model Representations via Symmetry Considerations
• Integer-programming software systems
• Job selection in a heavily loaded shop
• Order acceptance using genetic algorithms
• Order acceptance with weighted tardiness
• Permutation flow shop scheduling with order acceptance and weighted tardiness
• Selecting jobs for heavily loaded shop with lateness penalties
• Separation algorithms for 0-1 knapsack polytopes
• Symmetry in integer linear programming
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation

Cited in

(11)

• Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics
• A local search enhanced logic-based benders decomposition approach for order acceptance and scheduling problem with preemption
• 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
• Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
• The multiphase course timetabling problem
• Benders decomposition for a reverse logistics network design problem in the dairy industry
• A matheuristic for the generalized order acceptance and scheduling problem
• A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
• Integrated order acceptance and scheduling decision making in product service supply chain with hard time windows constraints

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)