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

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

Cited In (13)

• Single-machine primary-secondary scheduling with total tardiness being the primary criterion
• Scheduling to tradeoff between the number and the length of accepted jobs
• Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
• Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
• Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
• Title not available (Why is that?)
• Title not available (Why is that?)
• BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS
• Counting and enumeration complexity with application to multicriteria scheduling
• 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)