Login / Signup
A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints.
Boris Detienne
Published in:
Eur. J. Oper. Res. (2014)
Keyphrases
</>
mixed integer linear programming
number of late jobs
mixed integer
cutting plane
branch and bound algorithm
completion times
single machine
mathematical programming
integer program
global constraints
production planning
queue length
special case
integer programming
flowshop
linear program
random variables