Pareto and scalar bicriterion optimization in scheduling deteriorating jobs

DOI10.1016/j.cor.2004.07.016zbMath1116.90045OpenAlexW2034255737MaRDI QIDQ2566940

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

deteriorating jobssingle machinePareto optimalitymaximum completion timetotal completion timebicriterion scheduling

Mathematics Subject Classification ID

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

Related Items (15)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling jobs with varying processing times
• Multiple and bicriteria scheduling: A literature survey
• Two machine open shop scheduling problems with bi-criteria
• Scheduling jobs under simple linear deterioration
• Complexity analysis of job-shop scheduling with deteriorating jobs
• A concise survey of scheduling with time-dependent processing times
• Multicriteria optimization
• Parallel machine scheduling with time dependent processing times
• General Flowshop Models: Job Dependent Capacities, Job Overlapping and Deterioration
• Scheduling with time dependent processing times: Review and extensions
• Scheduling Deteriorating Jobs on a Single Processor
• Parametric problem in scheduling theory
• V-Shaped Policies for Scheduling Deteriorating Jobs
• The two-machine permutation flow shop with state-dependent processing times
• NP-hard cases in scheduling deteriorating jobs on dedicated machines
• Parallel Processing and Applied Mathematics
• Technical Note—Minimizing a Function of Permutations of n Integers
• Multi-Machine Scheduling With Linear Deterioration

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