A scheduling problem with job values given as a power function of their completion times

DOI10.1016/j.ejor.2007.11.006zbMath1151.90015OpenAlexW2066177378MaRDI QIDQ954933

Costas P. Pappis, Tomasz Krysiak, Adam Janiak, Theodore G. Voutsinas

Publication date: 18 November 2008

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.11.006

zbMATH Keywords

branch and boundheuristicexperimental analysis

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times ⋮ A generic approach to proving NP-hardness of partition type problems ⋮ Online scheduling of simple linear deteriorating jobs to minimize the total general completion time ⋮ A branch and bound algorithm for single machine scheduling with deteriorating values of jobs ⋮ Single machine group scheduling with time and position dependent processing times ⋮ Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities ⋮ Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling jobs under simple linear deterioration
• Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption
• Complexity analysis of job-shop scheduling with deteriorating jobs
• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• Uniform machine scheduling of unit-time jobs subject to resource constraints
• Single machine scheduling with a variable common due date and resource-dependent processing times.
• Single machine batch scheduling with deadlines and resource dependent processing times
• Scheduling identical jobs on uniform parallel machines
• The Single Machine Problem with a Quadratic Cost Function of Completion Times
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling independent tasks to reduce mean finishing time
• Minimizing maximum lateness under linear deterioration

This page was built for publication: A scheduling problem with job values given as a power function of their completion times