Changeover formulations for discrete-time mixed-integer programming scheduling models
type: Item
instance of: scholarly article
title: Changeover formulations for discrete-time mixed-integer programming scheduling models
zbMATH Open document ID: 1403.90373
author: Sara Velez
author: Yachao Dong
author: Christos T. Maravelias
published in: European Journal of Operational Research
publication date: 2018-05-29T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6875824
zbMATH Keywords: scheduling
zbMATH Keywords: integer programming
zbMATH Keywords: formulation tightness
zbMATH Keywords: manufacturing scheduling
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.01.004
OpenAlex ID: W2571324214
cites work: A branch and bound method for the job-shop problem with sequence-dependent setup times
cites work: A branch and bound to minimize the number of late jobs on a single machine with release time constraints
cites work: A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
cites work: Single-facility scheduling by logic-based Benders decomposition
cites work: Integrated methods for optimization.
cites work: Planning and Scheduling by Logic-Based Benders Decomposition
cites work: Algorithms for hybrid MILP/CP models for a class of optimization problems
cites work: The Deterministic Dynamic Product Cycling Problem
cites work: MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry
cites work: Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates
cites work: Optimal periodic scheduling of multipurpose batch plants
cites work: A time indexed formulation of non-preemptive single machine scheduling problems
cites work: Q3455613
cites work: Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
cites work: A polyhedral approach to single-machine scheduling problems.
cites work: Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
cites work: MIP modelling of changeovers in production planning and scheduling problems
cites work: Q4054818
cites work: Multi-Product Inventory Logistics Modeling in the Process Industries
DOI: 10.1016/J.EJOR.2017.01.004
description: scientific article; zbMATH DE number 6875824