A new heuristic for open shop total completion time problem

DOI10.1016/J.APM.2009.06.014MaRDI QIDQ967860zbMATH OpenOpenAlexFDO

Authors Lixin Tang, Danyu Bai

Publication date 2 May 2010

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2009.06.014

zbMATH Keywords

asymptotical analysisopen shop problemtotal completion time

Mathematics Subject Classification ID

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

Recommendations

• Constructive heuristic algorithms for the open shop problem
• A heuristic algorithm for open-shop scheduling problems with a single server
• Open shop scheduling with makespan and total completion time criteria
• On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem
• Heuristic constructive algorithms for open shop scheduling to minimize mean flow time

Cites work

• Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps
• Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 2114378 (Why is no real title available?)
• Open shop problems with unit time operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling the Open Shop to Minimize Mean Flow Time
• The total completion time open shop scheduling problem with a given sequence of jobs on one machine

Cited in

(14)

• Constructive heuristic algorithms for the open shop problem
• The total completion time open shop scheduling problem with a given sequence of jobs on one machine
• New efficient heuristics for scheduling open shops with makespan minimization
• Retracted article: Multi-objective open shop scheduling by considering human error and preventive maintenance
• Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
• A new particle swarm optimization for multi-objective open shop scheduling
• Open shop problem to minimize the total weighted completion time
• scientific article; zbMATH DE number 1910710 (Why is no real title available?)
• scientific article; zbMATH DE number 938619 (Why is no real title available?)
• On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem
• An heuristic approach for solving OSSP with a objective of minimizing total completion time and resource idleness
• Scheduling open shops with parallel machines to minimize total completion time
• The LPT heuristic for minimizing total load on a proportionate openshop
• A contribution and new heuristics for open shop scheduling

This page was built for publication: A new heuristic for open shop total completion time problem

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