Multicriteria scheduling (Q2566699): Difference between revisions

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

Latest revision as of 06:37, 19 December 2024

scientific article
Language Label Description Also known as
English
Multicriteria scheduling
scientific article

    Statements

    Multicriteria scheduling (English)
    0 references
    28 September 2005
    0 references
    Machine scheduling
    0 references
    Multicriteria
    0 references
    Pareto optimal
    0 references
    Earliness-tardiness
    0 references
    Controllable processing times
    0 references
    Simultaneous approximation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers