Multicriteria scheduling problems: a survey
From MaRDI portal
Recommendations
Cites work
- A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
- A bicriteria approach to the two-machine flow shop scheduling problem
- A bicriteria two-machine permutation flowshop problem
- A bicriterion approach to time/cost trade-offs in sequencing
- A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
- A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date
- 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
- A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
- A note on a scheduling problem with dual criteria
- A note on the extension of a result on scheduling with secondary criteria
- A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Bicriterion scheduling in the two-machine flowshop
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Complexity of single machine hierarchical scheduling: A survey
- Complexity of single machine, multi-criteria scheduling problems
- Connectedness of efficient solutions in multiple criteria combinatorial optimization
- Determination of an optimal common due date and optimal sequence in a single machine job shop
- Four solution techniques for a general one machine scheduling problem. A comparative study
- Genetic algorithms for the two-stage bicriteria flowshop problem
- Heuristics for scheduling in flowshop with multiple objectives
- scientific article; zbMATH DE number 4059106 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 4093162 (Why is no real title available?)
- scientific article; zbMATH DE number 3679573 (Why is no real title available?)
- scientific article; zbMATH DE number 7722 (Why is no real title available?)
- scientific article; zbMATH DE number 52239 (Why is no real title available?)
- scientific article; zbMATH DE number 3568375 (Why is no real title available?)
- scientific article; zbMATH DE number 680238 (Why is no real title available?)
- scientific article; zbMATH DE number 1086988 (Why is no real title available?)
- scientific article; zbMATH DE number 1128827 (Why is no real title available?)
- scientific article; zbMATH DE number 1149801 (Why is no real title available?)
- Hybrid algorithm for sequencing with bicriteria
- Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- Minimizing mean absolute deviation of completion times about a common due date
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Minimizing Schedule Length Subject to Minimum Flow Time
- Minimizing the average deviation of job completion times about a common due date
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- Multiple and bicriteria scheduling: A literature survey
- Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- ONE MACHINE SCHEDULING PROBLEM WITH DUAL CRITERIA
- One machine sequencing to minimize mean flow time with minimum number tardy
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Proper efficiency and the theory of vector maximization
- Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- Scheduling job families about an unrestricted common due date on a single machine
- Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method
- Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
- Scheduling to minimize the weighted sum of completion times with secondary criteria
- Scheduling unit processing time jobs on a single machine with multiple criteria
- Scheduling with Multiple Performance Measures: The One-Machine Case
- Single machine hierarchical scheduling with customer orders and multiple job classes
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach
- Single-machine scheduling to minimize absolute deviation of completion times from a common due date
- Single-machine scheduling with time windows and earliness/tardiness penalties
- Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
- Solving a bicriterion scheduling problem
- Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
- The parallel machine min-max weighted absolute lateness scheduling problem
- The Single Machine Early/Tardy Problem
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
- Two parallel machine sequencing problems involving controllable job processing times
- Two-Stage Flowshop Scheduling Problem with Bicriteria
Cited in
(91)- Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions
- 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
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case
- Multiple and bicriteria scheduling: A literature survey
- Incorporating preference information into multi-objective scheduling
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
- Competitive multi-agent scheduling with an iterative selection rule
- No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
- 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
- Minimizing the number of late jobs when the start time of the machine is variable
- An analysis of cyclic scheduling problems in robot centered cells
- Maximization of solution flexibility for robust shop scheduling
- Earliness-tardiness scheduling with setup considerations
- Two-machine flowshop scheduling with a secondary criterion
- Makespan minimization subject to flowtime optimality on identical parallel machines
- Rescheduling for new orders on a single machine with setup times
- Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
- Multipurpose machine scheduling with rejection and identical job processing times
- Scheduling batches in flowshop with limited buffers in the shampoo industry
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- The hybrid flow shop scheduling problem
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
- Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost
- Interactive bicriterion decision support for a large scale industrial scheduling system
- Scheduling two agent task chains with a central selection mechanism
- Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach
- K-PPM: a new exact method to solve multi-objective combinatorial optimization problems
- Algebraic solution of tropical optimization problems via matrix sparsification with application to scheduling
- A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem
- Multi-coloring and job-scheduling with assignment and incompatibility costs
- Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- A recovering beam search algorithm for the single machine just-in-time scheduling problem
- Best compromise solution for a new multiobjective scheduling problem
- 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
- Flowshop scheduling research after five decades
- Complexity of two dual criteria scheduling problems
- Efficiency and equity in the multi organization scheduling problem
- A survey of methods for the solution of problems of scheduling theory
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
- MP or not MP: that is the question
- Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices
- Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
- 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
- scientific article; zbMATH DE number 3860873 (Why is no real title available?)
- Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- On optimizing a bi-objective flowshop scheduling problem in an uncertain environment
- A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness
- A survey on offline scheduling with rejection
- Multi-criteria scheduling: an agent-based approach for expert knowledge integration
- scientific article; zbMATH DE number 592649 (Why is no real title available?)
- scientific article; zbMATH DE number 1149857 (Why is no real title available?)
- 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
- Multiobjective bed management considering emergency and elective patient flows
- scientific article; zbMATH DE number 2160610 (Why is no real title available?)
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- Constrained clustering by constraint programming
- scientific article; zbMATH DE number 6263315 (Why is no real title available?)
- scientific article; zbMATH DE number 5260995 (Why is no real title available?)
- Flowshop-scheduling problems with makespan criterion: a review
- Minimizing maximum lateness in two-stage projects by tropical optimization
- Counting and enumeration complexity with application to multicriteria scheduling
- A multivariate complexity analysis of the material consumption scheduling problem
- A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing
- The unbounded parallel-batching bicriteria scheduling with two-component jobs
- Minimizing bicriteria scheduling of two-component jobs on a bounded series-batching machine
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
- An exact parallel method for a bi-objective permutation flowshop problem
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine
- Skilled workforce scheduling in service centres
- Due dates assignment and JIT scheduling with equal-size jobs
- A parallel multiple reference point approach for multi-objective optimization
- Analyzing scheduling with transient failures
This page was built for publication: Multicriteria scheduling problems: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2773166)
