Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost

DOI10.1007/S10288-013-0244-1zbMATH Open1334.90051OpenAlexW1977916582MaRDI QIDQ457296FDOQ457296

Authors: Cheng He, Hao Lin, Xiumei Wang 

Publication date: 26 September 2014

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-013-0244-1

Recommendations

• Bicriteria scheduling on a series-batching machine to minimize makespan and total weighted completion time with equal length job
• Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work
• scientific article; zbMATH DE number 52239
• Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine
• A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure
• Bicriteria scheduling of equal length jobs on uniform parallel machines
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
• A single-machine bicriterion scheduling problem with setup times
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• scientific article; zbMATH DE number 1149801

zbMATH Keywords

total weighted completion timebicriteria schedulingmaximum costPareto optimal schedules

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Multicriteria scheduling problems: a survey
• Multicriteria scheduling
• Title not available (Why is that?)
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time

Cited In (5)

• A note on competing-agent Pareto-scheduling
• Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
• Bicriteria Scheduling on a Single Batching Machine with Transportation and Deterioration to Minimize Total Completion Time and Production Costs
• Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine

This page was built for publication: Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost

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