Open AccessScheduling family jobs on an unbounded parallel-batch machine to minimize makespan and maximum flow time
Author(s) -
Zhichao Geng,
Jinjiang Yuan
Publication year - 2018
Publication title -
journal of industrial and management optimization
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.325
H-Index - 32
eISSN - 1553-166X
pISSN - 1547-5816
DOI - 10.3934/jimo.2018017
Subject(s) - job shop scheduling , mathematical optimization , scheduling (production processes) , maximum flow problem , pareto optimal , pareto principle , flow shop scheduling , computer science , time complexity , mathematics , flow (mathematics) , multi objective optimization , combinatorics , routing (electronic design automation) , computer network , geometry
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom