A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates

DOI10.1016/J.COR.2005.02.032MaRDI QIDQ2489138zbMATH OpenOpenAlexFDO

Authors Moshe Kaspi, Dvir Shabtay

Publication date 16 May 2006

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

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

zbMATH Keywords

Bicriterion single machine schedulingConvex resource allocationSeries-parallel graphTime/cost trade-offs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• On scheduling a single machine with resource dependent release times
• Single machine scheduling problem with controllable processing times and resource dependent release times
• Single machine scheduling problems with resource dependent release times
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• Single machine scheduling with resource dependent release times and processing times

Cites work

• A bicriterion approach to time/cost trade-offs in sequencing
• A multi-objective approach to resource allocation in single machine scheduling
• Allocation of resources in project management
• Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• Cost-effectiveness of a preventive counseling and support package for postnatal depression
• scientific article; zbMATH DE number 4035555 (Why is no real title available?)
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• Optimal project compression with due-dated events
• Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions
• Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
• Single machine scheduling problem with a common deadline and resource dependent release dates
• Single machine scheduling subject to deadlines and resource dependent processing times
• Single machine scheduling with resource dependent release times and processing times
• Single machine sequencing with linear models of release dates
• Solving a bicriterion scheduling problem
• Solving a class of two-resource allocation problem by equivalent load method

Cited in

(14)

• Minimizing total tardiness on a single machine with controllable processing times
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
• Resource cost aware scheduling
• A survey of scheduling with controllable processing times
• Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine
• Single-machine group scheduling with deteriorating jobs and allotted resource
• Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect
• Scheduling with compressible and stochastic release dates
• Bicriteria scheduling problem for unrelated parallel machines with release dates
• Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions
• Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption
• A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
• Minimizing the number of late jobs for the permutation flowshop problem with secondary resources
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine

This page was built for publication: A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates

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