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

DOI10.1016/J.EJOR.2007.11.006MaRDI QIDQ954933zbMATH OpenOpenAlexFDO

Authors Adam Janiak, Tomasz Krysiak, Costas P. Pappis, 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

heuristicbranch and boundexperimental analysis

Mathematics Subject Classification ID

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

Recommendations

• On a certain class of power- and energy-related scheduling problems
• Scheduling problems with position dependent job processing times: computational complexity results
• Formulating a scheduling problem with almost identical jobs by using positional completion times
• Scheduling jobs with time-resource tradeoff via nonlinear programming
• scientific article; zbMATH DE number 4031379
• A problem of scheduling jobs with non-monotonic stepwise values
• scientific article; zbMATH DE number 4079152
• Approximability of scheduling with fixed jobs
• A minimax job completion-time problem revisited

Cites work

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

Cited in

(9)

• 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
• A branch and bound algorithm for single machine scheduling with deteriorating values of jobs
• Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
• Single machine group scheduling with time and position dependent processing times
• Single processor scheduling with job values depending on their completion times
• A generic approach to proving NP-hardness of partition type problems
• A problem of scheduling jobs with non-monotonic stepwise values
• An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times

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

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