Multicriteria scheduling

DOI10.1016/j.ejor.2004.07.011zbMath1154.90458OpenAlexW4211017838MaRDI QIDQ2566699

Hoogeveen, J. A.

Publication date: 28 September 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.07.011

zbMATH Keywords

Pareto optimalMulticriteriaMachine schedulingEarliness-tardinessControllable processing timesSimultaneous approximation

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Minimizing the weighted number of tardy jobs on multiple machines: a review, On the flexibility of a decision theory-based heuristic for single machine scheduling, A classification of predictive-reactive project scheduling procedures, A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem, A multi-criteria approach for scheduling semiconductor wafer fabrication facilities, Bicriteria robotic cell scheduling, Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach, Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness, Fast approximation algorithms for bi-criteria scheduling with machine assignment costs, Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects, Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan, A survey on scheduling problems with due windows, Pareto-scheduling of two competing agents with their own equal processing times, Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness, Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times, Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost, A survey of scheduling with controllable processing times, Total completion time minimization on multiple machines subject to machine availability and makespan constraints, Practical solutions for a dock assignment problem with trailer transportation, Optimizing emergency preparedness and resource utilization in mass-casualty incidents, Considering manufacturing cost and scheduling performance on a CNC turning machine, Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm, Complexity of two dual criteria scheduling problems, Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns, A (0-1) goal programming model for scheduling the tour of a marketing executive, Improving schedule stability in single-machine rescheduling for new operation insertion, Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom, Adaptive online scheduling of tasks with anytime property on heterogeneous resources, Solving a stochastic single machine problem with initial idle time and quadratic objective, BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN, Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan, Scheduling parallel CNC machines with time/cost trade-off considerations, A survey of single machine scheduling to minimize weighted number of tardy jobs, Two-agent scheduling of time-dependent jobs, Stochastic optimization approaches for elective surgery scheduling with downstream capacity constraints: models, challenges, and opportunities, Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines, Pareto minimizing total completion time and maximum cost with positional due indices, A survey on offline scheduling with rejection, Multi-criteria scheduling: an agent-based approach for expert knowledge integration, Two-agent scheduling with agent specific batches on an unbounded serial batching machine, Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost, Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine, On bilevel machine scheduling problems, Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem, Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints, Faster algorithms for bicriteria scheduling of identical jobs on uniform machines, Single-machine multi-agent scheduling problems with a global objective function, A mathematical model for the management of a service center, Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption, Bi-criteria scheduling on a single parallel-batch machine, A unified framework for population-based metaheuristics, Schedule-allocate and robust sequencing in three-machine robotic cell under breakdowns, Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost, Single-machine scheduling with maintenance activities and rejection, Bicriteria robotic cell scheduling with controllable processing times, Bicriteria scheduling with vacations on a single machine, Single-machine scheduling with maintenance in a manufacturing system, Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost, Minimizing the number of late jobs for the permutation flowshop problem with secondary resources, A note on unbounded parallel-batch scheduling, Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint, Bounded serial-batching scheduling for minimizing maximum lateness and makespan, Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints, A note on competing-agent Pareto-scheduling, Scheduling with time-of-use costs, Minimizing the number of late jobs when the start time of the machine is variable, Single-machine scheduling under the job rejection constraint, A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems, Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed, Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates, A search method for optimal control of a flow shop system of traditional machines, Unnamed Item, Single machine batch scheduling with two non-disjoint agents and splitable jobs, Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling, A DP algorithm for minimizing makespan and total completion time on a series-batching machine, Bi-objective scheduling on a restricted batching machine, Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion, Bi-objective parallel machine scheduling with additional resources during setups, Scheduling to minimize the maximum total completion time per machine, Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan, An approximation scheme for the bi-scenario sum of completion times trade-off problem, ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost, Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness, Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs, Machine scheduling in production: a content analysis, A multi-criteria scheduling with due-window assignment problem, A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties, Parallel machine makespan minimization subject to machine availability and total completion time constraints, Bicriteria scheduling of equal length jobs on uniform parallel machines, Unbounded serial-batching scheduling on hierarchical optimization, Bicriteria robotic operation allocation in a flexible manufacturing cell, Non-approximability of just-in-time scheduling, Scheduling interfering job sets on parallel machines, Scheduling with release dates and preemption to minimize multiple max-form objective functions, Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost, New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs, Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case, Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost, Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time, Bi-objective single machine scheduling problem with stochastic processing times, Scheduling with controllable processing times and compression costs using population-based heuristics, A note on resource allocation scheduling with position-dependent workloads, Bicriteria scheduling for due date assignment with total weighted tardiness, Hierarchical optimization on an unbounded parallel-batching machine, Bicriteria Scheduling on a Single Batching Machine with Transportation and Deterioration to Minimize Total Completion Time and Production Costs, Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work, A state-of-the-art survey on multi-scenario scheduling, Competitive two-agent scheduling with release dates and preemption on a single machine, Bicriteria multi-machine scheduling with equal processing times subject to release dates, Approximation algorithms for coupled task scheduling minimizing the sum of completion times, Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives, On the Integration of Theoretical Single-Objective Scheduling Results for Multi-objective Problems, Operational methods for minimization of energy consumption of manufacturing equipment, BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS, BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS, Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• Preemption in single machine earliness/tardiness scheduling
• A survey of results for sequencing problems with controllable processing times
• A two-machine flow shop scheduling problem with controllable job processing times
• Solving a bicriterion scheduling problem
• A bicriterion approach to time/cost trade-offs in sequencing
• Scheduling around a small common due date
• Bicriterion scheduling of identical processing time jobs by uniform processors
• Single machine scheduling subject to deadlines and resource dependent processing times
• A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date
• A bicriteria two-machine permutation flowshop problem
• Complexity of single machine, multi-criteria scheduling problems
• Two parallel machine sequencing problems involving controllable job processing times
• Two machine open shop scheduling problems with bi-criteria
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• Preemptive scheduling with rejection
• Preemptive scheduling with two minimax criteria
• Some comments on sequencing with controllable processing times
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
• A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
• Optimal timing of a sequence of tasks with general completion costs
• A bicriteria approach to the two-machine flow shop scheduling problem
• Open shop scheduling with makespan and total completion time criteria
• Scheduling unit processing time jobs on a single machine with multiple criteria
• An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• Finding the Pareto-optima for the total and maximum tardiness single machine problem
• PERT scheduling with convex cost functions.
• Two-machine flowshop scheduling with a secondary criterion
• Minimizing the total weighted flow time in a single machine with controllable processing times
• A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
• Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
• Proportionate flow shop with controllable processing times
• A multiple-criterion model for machine scheduling
• The one-machine problem with earliness and tardiness penalties
• Punctuality and idleness in just-in-time scheduling
• A simulated annealing approach to bicriteria scheduling problems on a single machine
• Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties
• Multicriteria scheduling problems: a survey
• Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem
• The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions
• Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
• Minimizing Total Tardiness on One Machine is NP-Hard
• Scheduling identical jobs on uniform parallel machines
• Minimizing the average deviation of job completion times about a common due date
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• Sequencing with Earliness and Tardiness Penalties: A Review
• Rescheduling for New Orders
• Minimizing mean absolute deviation of completion times about a common due date
• Single- and multiple-processor models for minimizing completion time variance
• Scheduling with Multiple Performance Measures: The One-Machine Case
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Minimizing Schedule Length Subject to Minimum Flow Time
• Preemptive Scheduling with Due Dates
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Two-Stage Flowshop Scheduling Problem with Bicriteria
• A note on a scheduling problem with dual criteria
• One machine sequencing to minimize mean flow time with minimum number tardy
• Open Shop Scheduling to Minimize Finish Time
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On the Minimization of the Makespan Subject to Flowtime Optimality
• New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Bicriterion scheduling in the two-machine flowshop
• Earliness-Tardiness Scheduling Around Almost Equal Due Dates
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• Techniques for scheduling with rejection
• Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis
• A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
• Minimizing Maximum Promptness and Maximum Lateness on a Single Machine
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
• Multiprocessor Scheduling with Rejection
• Bounds for Certain Multiprocessing Anomalies
• Technical Note—Minimizing Average Flow Time with Parallel Machines
• Scheduling with target start times
• A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times
• Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry