Multicriteria scheduling (Q2566699)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Multicriteria scheduling	scientific article

Statements

scholarly article

0 references

Multicriteria scheduling (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.ejor.2004.07.011

0 references

European Journal of Operational Research

0 references

publication date

28 September 2005

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

Machine scheduling

0 references

Multicriteria

0 references

Pareto optimal

0 references

Earliness-tardiness

0 references

Controllable processing times

0 references

Simultaneous approximation

0 references

Hoogeveen, J. A.

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2004.07.011

0 references

0 references

0 references

Two parallel machine sequencing problems involving controllable job processing times

0 references

A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date

0 references

0 references

Minimizing mean absolute deviation of completion times about a common due date

0 references

Sequencing with Earliness and Tardiness Penalties: A Review

0 references

A multiple-criterion model for machine scheduling

0 references

Multiprocessor Scheduling with Rejection

0 references

0 references

Preemption in single machine earliness/tardiness scheduling

0 references

Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs

0 references

0 references

Scheduling unit processing time jobs on a single machine with multiple criteria

0 references

Complexity of single machine, multi-criteria scheduling problems

0 references

A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem

0 references

Single-machine scheduling with trade-off between number of tardy jobs and resource allocation

0 references

Proportionate flow shop with controllable processing times

0 references

PERT scheduling with convex cost functions.

0 references

Scheduling identical jobs on uniform parallel machines

0 references

Minimizing Total Tardiness on One Machine is NP-Hard

0 references

On the Minimization of the Makespan Subject to Flowtime Optimality

0 references

One machine sequencing to minimize mean flow time with minimum number tardy

0 references

A note on a scheduling problem with dual criteria

0 references

0 references

Techniques for scheduling with rejection

0 references

An Overview of Techniques for Solving Multiobjective Mathematical Programs

0 references

The Complexity of Flowshop and Jobshop Scheduling

0 references

One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties

0 references

Open Shop Scheduling to Minimize Finish Time

0 references

A survey of the state-of-the-art of common due date assignment and scheduling research

0 references

Bounds for Certain Multiprocessing Anomalies

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs

0 references

Single- and multiple-processor models for minimizing completion time variance

0 references

Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date

0 references

Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date

0 references

Rescheduling for New Orders

0 references

0 references

Minimizing Maximum Promptness and Maximum Lateness on a Single Machine

0 references

Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria

0 references

New Lower and Upper Bounds for Scheduling Around a Small Common Due Date

0 references

Preemptive scheduling with rejection

0 references

Scheduling around a small common due date

0 references

Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time

0 references

A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time

0 references

Earliness-Tardiness Scheduling Around Almost Equal Due Dates

0 references

Scheduling with target start times

0 references

Some comments on sequencing with controllable processing times

0 references

Technical Note—Minimizing Average Flow Time with Parallel Machines

0 references

Single machine scheduling subject to deadlines and resource dependent processing times

0 references

Minimizing the average deviation of job completion times about a common due date

0 references

A simulated annealing approach to bicriteria scheduling problems on a single machine

0 references

Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem

0 references

0 references

Open shop scheduling with makespan and total completion time criteria

0 references

On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

0 references

Minimizing Maximum Lateness in a Two-Machine Open Shop

0 references

Approximation algorithms for scheduling unrelated parallel machines

0 references

Minimizing Schedule Length Subject to Minimum Flow Time

0 references

Bicriterion scheduling in the two-machine flowshop

0 references

Two machine open shop scheduling problems with bi-criteria

0 references

Scheduling <i>n</i> Independent Jobs on <i>m</i> Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis

0 references

A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem

0 references

Scheduling with Multiple Performance Measures: The One-Machine Case

0 references

A two-machine flow shop scheduling problem with controllable job processing times

0 references

A survey of results for sequencing problems with controllable processing times

0 references

A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times

0 references

0 references

Two-Stage Flowshop Scheduling Problem with Bicriteria

0 references

Preemptive Scheduling with Due Dates

0 references

A bicriteria approach to the two-machine flow shop scheduling problem

0 references

Minimizing the total weighted flow time in a single machine with controllable processing times

0 references

A bicriteria two-machine permutation flowshop problem

0 references

Preemptive scheduling with two minimax criteria

0 references

Optimal timing of a sequence of tasks with general completion costs

0 references

The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions

0 references

Punctuality and idleness in just-in-time scheduling

0 references

The one-machine problem with earliness and tardiness penalties

0 references

On the existence of schedules that are near-optimal for both makespan and total weighted completion time

0 references

Finding the Pareto-optima for the total and maximum tardiness single machine problem

0 references

Multicriteria scheduling problems: a survey

0 references

Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry

0 references

Two-machine flowshop scheduling with a secondary criterion

0 references

An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem

0 references

0 references

Bicriterion scheduling of identical processing time jobs by uniform processors

0 references

Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties

0 references

Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine

0 references

Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties

0 references

Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.

0 references

Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem

0 references

A bicriterion approach to time/cost trade-offs in sequencing

0 references

Solving a bicriterion scheduling problem

0 references

0 references

A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2566699

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2566699&oldid=34422275"