Multicriteria scheduling problems: a survey
From MaRDI portal
Publication:2773166
DOI10.1051/ro:2001109zbMath1014.90046OpenAlexW1985168944MaRDI QIDQ2773166
Jean-Charles Billaut, Vincent T'kindt
Publication date: 21 April 2002
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2001__35_2_143_0
Multi-objective and goal programming (90C29) Stochastic scheduling theory in operations research (90B36) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic, Single machine scheduling with two competing agents, arbitrary release dates and unit processing times, MP or not MP: that is the question, Makespan minimization subject to flowtime optimality on identical parallel machines, Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach, Fast approximation algorithms for bi-criteria scheduling with machine assignment costs, \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems, Single machine scheduling with two competing agents and equal job processing times, Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption, Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach, Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm, Complexity of two dual criteria scheduling problems, An exact parallel method for a bi-objective permutation flowshop problem, Algebraic solution of tropical optimization problems via matrix sparsification with application to scheduling, On optimizing a bi-objective flowshop scheduling problem in an uncertain environment, Parallel partitioning method (PPM): A new exact method to solve bi-objective problems, Rescheduling for new orders on a single machine with setup times, 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, Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices, A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem, Multiobjective bed management considering emergency and elective patient flows, Time and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centres, Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost, On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems., Multi-coloring and job-scheduling with assignment and incompatibility costs, Competitive multi-agent scheduling with an iterative selection rule, Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint, Constrained clustering by constraint programming, No-wait flowshop scheduling problem with two criteria; total tardiness and makespan, Skilled workforce scheduling in service centres, Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints, The resource dependent assignment problem with a convex agent cost function, Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches, Scheduling batches in flowshop with limited buffers in the shampoo industry, Minimizing the number of late jobs when the start time of the machine is variable, Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints, A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems, Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates, Bicriterion scheduling with a negotiable common due window and resource-dependent processing times, An analysis of cyclic scheduling problems in robot centered cells, A recovering beam search algorithm for the single machine just-in-time scheduling problem, Best compromise solution for a new multiobjective scheduling problem, Due dates assignment and JIT scheduling with equal-size jobs, A parallel multiple reference point approach for multi-objective optimization, Maximization of solution flexibility for robust shop scheduling, The hybrid flow shop scheduling problem, Multipurpose machine scheduling with rejection and identical job processing times, Earliness-tardiness scheduling with setup considerations, A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness, Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling, Analyzing scheduling with transient failures, Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions, Flowshop-scheduling problems with makespan criterion: a review, A tabu search algorithm for scheduling pharmaceutical packaging operations, Approximation results for a bicriteria job scheduling problem on a single machine without preemption, Scheduling interfering job sets on parallel machines, Multicriteria scheduling, A new bounding mechanism for the CNC machine scheduling problems with controllable processing times, A multiobjective evolutionary algorithm for scheduling and inspection planning in software development projects, Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs, A multi-objective genetic algorithm for mixed-model sequencing on JIT assembly lines, Genetic local search for multi-objective flowshop scheduling problems, Punctuality and idleness in just-in-time scheduling, Bicriteria train scheduling for high-speed passenger railroad planning applications, A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of 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, Flowshop scheduling research after five decades, Interactive bicriterion decision support for a large scale industrial scheduling system, Heuristics for hybrid flow shops with controllable processing times and assignable due dates, Scheduling two agent task chains with a central selection mechanism, Two-machine flowshop scheduling with a secondary criterion, Minimizing maximum lateness in two-stage projects by tropical optimization
Cites Work
- A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
- Multiple and bicriteria scheduling: A literature survey
- Solving a bicriterion scheduling problem
- Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach
- Hybrid algorithm for sequencing with bicriteria
- A bicriterion approach to time/cost trade-offs in sequencing
- Four solution techniques for a general one machine scheduling problem. A comparative study
- Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- Single-machine scheduling with time windows and earliness/tardiness penalties
- Genetic algorithms for the two-stage bicriteria flowshop problem
- Connectedness of efficient solutions in multiple criteria combinatorial optimization
- 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
- Single machine hierarchical scheduling with customer orders and multiple job classes
- Heuristics for scheduling in flowshop with multiple objectives
- A bicriteria approach to the two-machine flow shop scheduling problem
- Scheduling unit processing time jobs on a single machine with multiple criteria
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- Proper efficiency and the theory of vector maximization
- Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Minimizing the average deviation of job completion times about a common due date
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Minimizing mean absolute deviation of completion times about a common due date
- A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
- Scheduling with Multiple Performance Measures: The One-Machine Case
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
- Determination of an optimal common due date and optimal sequence in a single machine job shop
- A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- The Single Machine Early/Tardy Problem
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Minimizing Schedule Length Subject to Minimum Flow Time
- Single-machine scheduling to minimize absolute deviation of completion times from a common due date
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- ONE MACHINE SCHEDULING PROBLEM WITH DUAL CRITERIA
- Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- 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
- Scheduling to minimize the weighted sum of completion times with secondary criteria
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date
- Scheduling job families about an unrestricted common due date on a single machine
- The parallel machine min-max weighted absolute lateness scheduling problem
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Bicriterion scheduling in the two-machine flowshop
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
- Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
- 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
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- A note on the extension of a result on scheduling with secondary criteria
- Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
