An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times

DOI10.1016/j.amc.2013.12.127zbMath1410.90100OpenAlexW2023010831MaRDI QIDQ1644059

Danyu Bai, Zhi-Hai Zhang

Publication date: 21 June 2018

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2013.12.127

zbMATH Keywords

Lagrangian relaxationschedulingdynamic programmingopen shopoptimal propertyquadratic completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (1)

Multi-objective open shop scheduling by considering human error and preventive maintenance

Cites Work

• Unnamed Item
• Unnamed Item
• Single processor scheduling with job values depending on their completion times
• A scheduling problem with job values given as a power function of their completion times
• Open shop scheduling with machine dependent processing times
• Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires
• Fifty years of scheduling: a survey of milestones
• Single machine scheduling with time deteriorating job values
• Open Shop Scheduling to Minimize Finish Time
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem

This page was built for publication: An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times