Výsledky vyhľadávania - Customer order scheduling Linear programming relaxation Approximation algorithm
-
1
Customer order scheduling to minimize total weighted completion time
ISSN: 0305-0483, 1873-5274Vydavateľské údaje: Exeter Elsevier Ltd 01.10.2007Vydané v Omega (Oxford) (01.10.2007)“…In this paper we study the scheduling problem in which each customer order consists of several jobs of different types, which are to be processed on m facilities…”
Získať plný text
Journal Article -
2
MIP-based heuristics for solving robust gate assignment problems
ISSN: 0360-8352, 1879-0550Vydavateľské údaje: New York Elsevier Ltd 01.03.2016Vydané v Computers & industrial engineering (01.03.2016)“…•We transit the quadratic objective function to an equivalent linear one.•The first one to adapt general MIP solving methods to solve GAP…”
Získať plný text
Journal Article