A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs

DOI10.1007/S11741-007-0503-3MaRDI QIDQ5456312zbMATH OpenOpenAlexFDO

Authors Mingbao Cheng, Shijie Sun

Publication date 4 April 2008

Published in Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11741-007-0503-3

zbMATH Keywords

deterioration jobscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Heuristics for parallel machine scheduling with deterioration effect
• Semi-online algorithms for parallel machine scheduling problems
• Improved algorithms for online scheduling of malleable parallel jobs on two identical machines
• A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection
• Optimal semi-online algorithm for scheduling on two parallel batch processing machines
• A semi-on-line scheduling problem of two parallel machines with common maintenance time
• scientific article; zbMATH DE number 5583893
• An optimal semi-online algorithm for 2-machine scheduling with an availability constraint
• Online scheduling of malleable parallel jobs with setup times on two identical machines
• An approximation algorithm for parallel machine scheduling with simple linear deterioration

Cites work

• Bounds on Multiprocessing Timing Anomalies
• Complexity analysis of job-shop scheduling with deteriorating jobs
• Semi on-line scheduling on two identical machines
• Semi-on-line scheduling problems for maximizing the minimum machine completion time

Cited in

(4)

• Online scheduling on a single machine with linear deteriorating processing times and delivery times
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
• Theory and methodology of time-dependent scheduling: past, present and future

This page was built for publication: A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs

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