A time-dependent multiple criteria single-machine scheduling problem

DOI10.1016/S0377-2217(00)00286-1MaRDI QIDQ5954823zbMATH OpenOpenAlexWikidataFDO

Authors Kathrin Klamroth, Margaret M. Wiecek

Publication date 2001

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-2217(00)00286-1

zbMATH Keywords

SchedulingSingle machineTime-dependent multiple criteria

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• Scheduling unit processing time jobs on a single machine with multiple criteria
• scientific article; zbMATH DE number 1149857
• scientific article; zbMATH DE number 721865
• scientific article; zbMATH DE number 2219123

Cites work

• A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem
• A polyhedral approach to single-machine scheduling problems.
• A time indexed formulation of non-preemptive single machine scheduling problems
• Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
• scientific article; zbMATH DE number 3934710 (Why is no real title available?)
• scientific article; zbMATH DE number 955199 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1264428 (Why is no real title available?)
• scientific article; zbMATH DE number 702559 (Why is no real title available?)
• scientific article; zbMATH DE number 1086988 (Why is no real title available?)
• scientific article; zbMATH DE number 1149801 (Why is no real title available?)
• scientific article; zbMATH DE number 3410784 (Why is no real title available?)
• Minimizing Maximum Promptness and Maximum Lateness on a Single Machine
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
• Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
• New trends in exact algorithms for the \(0-1\) knapsack problem
• Relocation problems arising in conservation biology
• Scheduling with time dependent processing times: Review and extensions
• Single machine hierarchical scheduling with customer orders and multiple job classes
• The complexity of scheduling starting time dependent tasks with release times
• The dynamic and stochastic knapsack problem
• The time dependent machine makespan problem is strongly NP-complete
• Time dependency in multiple objective dynamic programming

Cited in

(7)

• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• A multi-period machine assignment problem
• scientific article; zbMATH DE number 4059107 (Why is no real title available?)
• Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine
• scientific article; zbMATH DE number 1530371 (Why is no real title available?)
• Dynamic programming with ordered structures: Theory, examples and applications

Describes a project that uses

Uses Software

• Matlab
• Knapsack

This page was built for publication: A time-dependent multiple criteria single-machine scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954823)