Pareto and scalar bicriterion optimization in scheduling deteriorating jobs

DOI10.1016/J.COR.2004.07.016MaRDI QIDQ2566940zbMATH OpenOpenAlexFDO

Authors Stanisław Gawiejnowicz, Lidia Pankowska, Wiesław Kurc

Publication date 29 September 2005

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2004.07.016

zbMATH Keywords

bicriterion schedulingdeteriorating jobsmaximum completion timePareto optimalitysingle machinetotal completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Pareto approximations for the bicriteria scheduling problem
• Scheduling jobs under decreasing linear deterioration
• A note on parallel-machine scheduling with deteriorating jobs
• On a scheduling problem of time deteriorating jobs
• scientific article; zbMATH DE number 1859291
• Pareto optimizations for rescheduling problems
• Scheduling time-dependent jobs under mixed deterioration
• Parallel-machine scheduling with deteriorating jobs and rejection
• Parallel-machine scheduling problem with deteriorating jobs and rejection
• Resource allocation scheduling with deteriorating jobs and position-dependent workloads

Cites work

• A concise survey of scheduling with time-dependent processing times
• Complexity analysis of job-shop scheduling with deteriorating jobs
• Complexity of single machine hierarchical scheduling: A survey
• General Flowshop Models: Job Dependent Capacities, Job Overlapping and Deterioration
• scientific article; zbMATH DE number 4162635 (Why is no real title available?)
• scientific article; zbMATH DE number 955199 (Why is no real title available?)
• scientific article; zbMATH DE number 52239 (Why is no real title available?)
• scientific article; zbMATH DE number 1264428 (Why is no real title available?)
• scientific article; zbMATH DE number 1313467 (Why is no real title available?)
• scientific article; zbMATH DE number 724323 (Why is no real title available?)
• scientific article; zbMATH DE number 2086777 (Why is no real title available?)
• Multi-Machine Scheduling With Linear Deterioration
• Multicriteria optimization
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• Multiple and bicriteria scheduling: A literature survey
• NP-hard cases in scheduling deteriorating jobs on dedicated machines
• Parallel machine scheduling with time dependent processing times
• Parallel Processing and Applied Mathematics
• Parametric problem in scheduling theory
• Scheduling Deteriorating Jobs on a Single Processor
• Scheduling jobs under simple linear deterioration
• Scheduling jobs with varying processing times
• Scheduling with time dependent processing times: Review and extensions
• Technical Note—Minimizing a Function of Permutations of n Integers
• The two-machine permutation flow shop with state-dependent processing times
• Two machine open shop scheduling problems with bi-criteria
• V-Shaped Policies for Scheduling Deteriorating Jobs

Cited in

(18)

• Equivalent time-dependent scheduling problems
• Coke production scheduling problem: a parallel machine scheduling with batch preprocessings and location-dependent processing times
• Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
• New results for an open time-dependent scheduling problem
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• Pareto approximations for the bicriteria scheduling problem
• Single-machine scheduling with time-and-resource-dependent processing times
• Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs
• Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
• Single machine two-agent scheduling with deteriorating jobs
• Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times
• Scheduling linearly shortening jobs under precedence constraints
• A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration
• Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
• Theory and methodology of time-dependent scheduling: past, present and future
• Single-machine scheduling with nonlinear deterioration
• Single machine group scheduling with time dependent processing times and ready times
• A note on single-machine scheduling with decreasing time-dependent job processing times

This page was built for publication: Pareto and scalar bicriterion optimization in scheduling deteriorating jobs

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