Complexity of single machine, multi-criteria scheduling problems
From MaRDI portal
Publication:1309989
DOI10.1016/0377-2217(93)90236-GzbMath0795.90032MaRDI QIDQ1309989
Robert L. Bulfin, Chuen-Lung S. Chen
Publication date: 20 December 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Simultaneous minimization of total completion time and total deviation of job completion times ⋮ On the flexibility of a decision theory-based heuristic for single machine scheduling ⋮ Solving multi-objective production scheduling problems using metaheuristics ⋮ Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs ⋮ Multicriteria scheduling using fuzzy theory and tabu search ⋮ Total completion time minimization on multiple machines subject to machine availability and makespan constraints ⋮ Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness ⋮ Complexity of two dual criteria scheduling problems ⋮ Two machine scheduling under disruptions with transportation considerations ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines ⋮ Multi-criteria scheduling: an agent-based approach for expert knowledge integration ⋮ Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints ⋮ Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines ⋮ On the complexity of bi-criteria scheduling on a single batch processing machine ⋮ Bi-criteria scheduling on a single parallel-batch machine ⋮ Bicriterion scheduling with equal processing times on a batch processing machine ⋮ Scheduling with time-of-use costs ⋮ Minimizing makespan subject to minimum flowtime on two identical parallel machines ⋮ Multicriteria scheduling problems: a survey ⋮ Minimizing total completion time and total deviation of job completion times from a restrictive due-date ⋮ Minimizing flowtime subject to optimal makespan on two identical parallel machines ⋮ Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion ⋮ Parallel machine makespan minimization subject to machine availability and total completion time constraints ⋮ BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS ⋮ Genetic algorithms for the two-stage bicriteria flowshop problem ⋮ New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs ⋮ Multicriteria scheduling ⋮ Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs ⋮ Minimizing makespan subject to minimum total flow-time on identical parallel machines ⋮ A bicriteria two-machine permutation flowshop problem ⋮ Finding the Pareto-optima for the total and maximum tardiness single machine problem ⋮ Using genetic algorithms for single-machine bicriteria scheduling problems
Cites Work
- Solving a bicriterion scheduling problem
- Scheduling unit processing time jobs on a single machine with multiple criteria
- Minimizing Total Tardiness on One Machine is NP-Hard
- A note on a scheduling problem with dual criteria
- One machine sequencing to minimize mean flow time with minimum number tardy
- On general routing problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
