Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
From MaRDI portal
Publication:1640598
DOI10.1007/s13369-017-2763-0zbMath1390.90330OpenAlexW2741277671MaRDI QIDQ1640598
Jie He, Zhijun Xu, Aihua Liu, Dehua Xu, Qi Wang, Jun-Fang Xiao
Publication date: 14 June 2018
Published in: Arabian Journal for Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13369-017-2763-0
Related Items (1)
Cites Work
- Unnamed Item
- MP or not MP: that is the question
- Book review of: A. Agnetis et al., Multiagent scheduling. Models and algorithms
- A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints
- Scheduling with tool changes to minimize total completion time: Basic results and SPT performance
- Stochastic optimization for the calculation of the time dependency of the physiological demand during exercise and recovery
- Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint
- Mathematical programming formulations for machine scheduling: A survey
- Scheduling with tool changes to minimize total completion time under controllable machining conditions
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
- Approximation results for flow shop scheduling problems with machine availability constraints
- An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
- Two-machine flowshop scheduling with availability constraints
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- Two-machine flowshop scheduling with consecutive availability constraints
- Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities
- Two models for a family of flowshop sequencing problems
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Two-machine scheduling with periodic availability constraints to minimize makespan
- Two MILP models for the N × M SDST flowshop sequencing problem
- Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
- A study of integer programming formulations for scheduling problems
- An FPTAS for scheduling a two-machine flowshop with one unavailability interval
- New MILP models for the permutation flowshop problem
- On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
- An Improved Formulation for the Job-Shop Scheduling Problem
- Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
- On ‘redundant’ constraints in Stafford's MILP model for the flowshop problem
- Comparative evaluation of MILP flowshop models
This page was built for publication: Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint
