scientific article; zbMATH DE number 5951383

MaRDI QIDQ3170676zbMATH OpenFDO

Authors Weigang Zhou, Chengxiu Gao, Kai Huang

Publication date 29 September 2011

zbMATH Keywords

0-1 nonlinear programminggreedy algorithmparallel machine schedulingprocessing time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• Parallel machine scheduling with linearly decreasing processing times
• Approximation schemes for parallel machine scheduling problems with controllable processing times
• Just-in-time scheduling with controllable processing times on parallel machines
• Parallel machine scheduling with time dependent processing times
• Linear time algorithms for parallel machine scheduling
• Algorithmic Applications in Management
• Parallel-machine scheduling with time dependent processing times
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time
• A 32-approximation algorithm for parallel machine scheduling with controllable processing times
• Uniform parallel-machine scheduling with time dependent processing times

Cited in

(7)

• Two parallel machine sequencing problems involving controllable job processing times
• A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time
• Approximation schemes for parallel machine scheduling problems with controllable processing times
• The inverse parallel machine scheduling problem with minimum total completion time
• An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
• Parallel machine scheduling with linearly decreasing processing times
• Just-in-time scheduling with controllable processing times on parallel machines

This page was built for publication:

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