Multicriteria scheduling
From MaRDI portal
Publication:2566699
Recommendations
Cites work
- A 32-approximation algorithm for parallel machine scheduling with controllable processing times
- A bicriteria approach to the two-machine flow shop scheduling problem
- A bicriteria two-machine permutation flowshop problem
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- A bicriterion approach to time/cost trade-offs in sequencing
- A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
- A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- A multiple-criterion model for machine scheduling
- A note on a scheduling problem with dual criteria
- 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 simulated annealing approach to bicriteria scheduling problems on a single machine
- A survey of results for sequencing problems with controllable processing times
- A survey of the state-of-the-art of common due date assignment and scheduling research
- A two-machine flow shop scheduling problem with controllable job processing times
- An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Approximation algorithms for scheduling unrelated parallel machines
- Bicriterion scheduling in the two-machine flowshop
- Bicriterion scheduling of identical processing time jobs by uniform processors
- Bounds for Certain Multiprocessing Anomalies
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem
- Complexity of single machine, multi-criteria scheduling problems
- Earliness-Tardiness Scheduling Around Almost Equal Due Dates
- 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
- Finding the Pareto-optima for the total and maximum tardiness single machine problem
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 4059106 (Why is no real title available?)
- scientific article; zbMATH DE number 47262 (Why is no real title available?)
- scientific article; zbMATH DE number 52239 (Why is no real title available?)
- scientific article; zbMATH DE number 1305482 (Why is no real title available?)
- scientific article; zbMATH DE number 1305545 (Why is no real title available?)
- scientific article; zbMATH DE number 2102785 (Why is no real title available?)
- scientific article; zbMATH DE number 798135 (Why is no real title available?)
- Minimizing Maximum Lateness in a Two-Machine Open Shop
- Minimizing Maximum Promptness and Maximum Lateness on a Single Machine
- Minimizing mean absolute deviation of completion times about a common due date
- Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
- Minimizing Schedule Length Subject to Minimum Flow Time
- Minimizing the average deviation of job completion times about a common due date
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- Minimizing Total Tardiness on One Machine is NP-Hard
- Multicriteria scheduling problems: a survey
- Multiprocessor Scheduling with Rejection
- Network flows. Theory, algorithms, and applications.
- New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time
- On the Minimization of the Makespan Subject to Flowtime Optimality
- One machine sequencing to minimize mean flow time with minimum number tardy
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Open Shop Scheduling to Minimize Finish Time
- Open shop scheduling with makespan and total completion time criteria
- Optimal timing of a sequence of tasks with general completion costs
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- PERT scheduling with convex cost functions.
- Preemption in single machine earliness/tardiness scheduling
- Preemptive Scheduling with Due Dates
- Preemptive scheduling with rejection
- Preemptive scheduling with two minimax criteria
- Proportionate flow shop with controllable processing times
- Punctuality and idleness in just-in-time scheduling
- Rescheduling for New Orders
- Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis
- Scheduling around a small common due date
- Scheduling identical jobs on uniform parallel machines
- Scheduling unit processing time jobs on a single machine with multiple criteria
- Scheduling with Multiple Performance Measures: The One-Machine Case
- Scheduling with target start times
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single machine scheduling subject to deadlines and resource dependent processing times
- Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
- Single- and multiple-processor models for minimizing completion time variance
- Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
- Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
- Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
- Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
- Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
- Solving a bicriterion scheduling problem
- Some comments on sequencing with controllable processing times
- Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- Techniques for scheduling with rejection
- The Complexity of Flowshop and Jobshop Scheduling
- The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
- The one-machine problem with earliness and tardiness penalties
- Two machine open shop scheduling problems with bi-criteria
- Two parallel machine sequencing problems involving controllable job processing times
- Two-machine flowshop scheduling with a secondary criterion
- Two-Stage Flowshop Scheduling Problem with Bicriteria
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
Cited in
(only showing first 100 items - show all)- 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
- Bicriteria robotic operation allocation in a flexible manufacturing cell
- Non-approximability of just-in-time scheduling
- Scheduling interfering job sets on parallel machines
- 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
- Multiple and bicriteria scheduling: A literature survey
- On the flexibility of a decision theory-based heuristic for single machine scheduling
- Bounded serial-batching scheduling for minimizing maximum lateness and makespan
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
- Scheduling with time-of-use costs
- Minimizing the number of late jobs when the start time of the machine is variable
- Bi-objective scheduling on a restricted batching machine
- A note on competing-agent Pareto-scheduling
- Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed
- Single machine batch scheduling with two non-disjoint agents and splitable jobs
- 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
- Unbounded serial-batching scheduling on hierarchical optimization
- Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
- Pareto-scheduling of two competing agents with their own equal processing times
- 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
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
- Schedule-allocate and robust sequencing in three-machine robotic cell under breakdowns
- Single-machine scheduling with maintenance activities and rejection
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
- 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
- Machine scheduling in production: a content analysis
- Parallel machine makespan minimization subject to machine availability and total completion time constraints
- Bicriteria scheduling of equal length jobs on uniform parallel machines
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
- Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost
- Bi-objective single machine scheduling problem with stochastic processing times
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach
- A survey of scheduling with controllable processing times
- Two-agent scheduling of time-dependent jobs
- Single-machine multi-agent scheduling problems with a global objective function
- Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
- 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
- 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
- Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects
- A survey on scheduling problems with due windows
- Complexity of two dual criteria scheduling problems
- Solving a stochastic single machine problem with initial idle time and quadratic objective
- Stochastic optimization approaches for elective surgery scheduling with downstream capacity constraints: models, challenges, and opportunities
- 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
- Faster algorithms for bicriteria scheduling of identical jobs on uniform machines
- Multicriteria scheduling problems: a survey
- An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives
- Batching machine scheduling with bicriteria: maximum cost and makespan
- 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
- 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
- Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
- Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness
- Scheduling with controllable processing times and compression costs using population-based heuristics
- 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
- Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
- Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns
- BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
- BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS
- Improving schedule stability in single-machine rescheduling for new operation insertion
- Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- Adaptive online scheduling of tasks with anytime property on heterogeneous resources
- Multi-Item Scheduling by Benders' Decomposition
- 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
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
- A survey on offline scheduling with rejection
- Multi-criteria scheduling: an agent-based approach for expert knowledge integration
- On bilevel machine scheduling problems
- scientific article; zbMATH DE number 592649 (Why is no real title available?)
- Bi-criteria scheduling on a single parallel-batch machine
- Bicriteria scheduling for due date assignment with total weighted tardiness
- Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost
- Hierarchical optimization on an unbounded parallel-batching machine
- On the integration of theoretical single-objective scheduling results for multi-objective problems
- scientific article; zbMATH DE number 2160610 (Why is no real title available?)
- A note on unbounded parallel-batch scheduling
- A note on resource allocation scheduling with position-dependent workloads
- Bicriteria Scheduling on a Single Batching Machine with Transportation and Deterioration to Minimize Total Completion Time and Production Costs
- Operational methods for minimization of energy consumption of manufacturing equipment
- scientific article; zbMATH DE number 5260995 (Why is no real title available?)
- Min-max scheduling of batch or drop-line jobs under agreeable release and processing times
- 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
This page was built for publication: Multicriteria scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2566699)
