Bicriteria scheduling problem for unrelated parallel machines with release dates

DOI10.1016/j.cor.2015.04.025zbMath1349.90375OpenAlexW322085680MaRDI QIDQ342063

Yang-Kuei Lin, Hao-Chen Lin

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.04.025

zbMATH Keywords

schedulingrelease datesunrelated parallel machinestabu search algorithmbicriteria

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
• Scheduling unrelated parallel machines with sequence-dependent setups
• Scheduling interfering job sets on parallel machines
• New multi-objective method to solve reentrant hybrid flow shop scheduling problem
• A time indexed formulation of non-preemptive single machine scheduling problems
• Algorithms minimizing mean flow time: Schedule-length properties
• A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines.
• On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
• Minimizing makespan subject to minimum total flow-time on identical parallel machines
• Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
• Makespan minimization subject to flowtime optimality on identical parallel machines
• Parallel machine selection and job scheduling to minimize machine cost and job tardiness
• A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
• Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs
• Improved approximation schemes for scheduling unrelated parallel machines
• Bicriteria optimisation of the makespan and mean flowtime on two identical parallel machines
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On the Minimization of the Makespan Subject to Flowtime Optimality
• Minimizing makespan subject to minimum flowtime on two identical parallel machines

This page was built for publication: Bicriteria scheduling problem for unrelated parallel machines with release dates