Minimizing makespan on two parallel machines with learning effects

DOI10.15960/J.CNKI.ISSN.1007-6093.2018.01.004MaRDI QIDQ4690848zbMATH OpenFDO

Authors Zhenglu Zhu, Xiwen Lu

Publication date 22 October 2018

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2018.01.004

zbMATH Keywords

integer programminglearning effectsnumerical simulationparallel machinessimulated annealing algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Parallel machine scheduling with a learning effect
• Flow-shop scheduling of two machines with learning effect
• Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
• Scheduling problems with a learning effect
• Flow-shop scheduling with a learning effect

Cited in

(4)

• Parallel machine scheduling with general sum of processing time based models
• Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
• Near-optimal solutions and tight lower bounds for the parallel machines scheduling problem with learning effect
• Optimal algorithms for hybrid flow shop schedule on two machines with learning effect

This page was built for publication: Minimizing makespan on two parallel machines with learning effects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4690848)