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

DOI10.1007/s11741-007-0503-3zbMath1174.90461OpenAlexW2000984542MaRDI QIDQ5456312

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

schedulingdeterioration job

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

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

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