Complexity of two dual criteria scheduling problems

DOI10.1016/J.ORL.2006.01.007zbMATH Open1149.90342OpenAlexW2033326904MaRDI QIDQ2643797FDOQ2643797

Authors Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao

Publication date 27 August 2007

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2006.01.007

zbMATH Keywords

single machineNP-harddual criteria

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cites work

• scientific article; zbMATH DE number 1634827 (Why is no real title available?)
• scientific article; zbMATH DE number 3425355 (Why is no real title available?)
• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A note on a scheduling problem with dual criteria
• A note on the extension of a result on scheduling with secondary criteria
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Complexity of single machine, multi-criteria scheduling problems
• Minimizing Total Tardiness on One Machine is NP-Hard
• Multicriteria scheduling
• Multicriteria scheduling problems: a survey
• One machine sequencing to minimize mean flow time with minimum number tardy
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

Cited in

(13)

• Scheduling to tradeoff between the number and the length of accepted jobs
• BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS
• New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
• Counting and enumeration complexity with application to multicriteria scheduling
• scientific article; zbMATH DE number 3864974 (Why is no real title available?)
• scientific article; zbMATH DE number 3904310 (Why is no real title available?)
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• Single-machine primary-secondary scheduling with total tardiness being the primary criterion
• Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
• Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
• Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
• Single-machine multi-agent scheduling problems with a global objective function
• Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness

This page was built for publication: Complexity of two dual criteria scheduling problems

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