Using PBIL to minimize makespan for parallel machines scheduling problem with job sequence dependent setup time

MaRDI QIDQ5034201zbMATH OpenFDO

Authors Pensiri Sompong

Publication date 24 February 2022

Full work available at URL http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/5129

zbMATH Keywords

schedulingparallel machinespopulation-based incremental learningsequence dependent

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Makespan minimization for parallel machines environment with machine dependent processing time by using PBIL combined with local search
• A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times
• ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times
• Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
• A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times

Cites work

• Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects

Cited in

(2)

• Makespan minimization for parallel machines environment with machine dependent processing time by using PBIL combined with local search
• An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times

This page was built for publication: Using PBIL to minimize makespan for parallel machines scheduling problem with job sequence dependent setup time

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