Bicriterion Single Machine Scheduling with Resource Dependent Processing Times

DOI10.1137/S1052623495288192MaRDI QIDQ4389208zbMATH OpenOpenAlexFDO

Authors T. C. Edwin Cheng, Adam Janiak, M. Y. Kovalyov

Publication date 12 May 1998

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1052623495288192

zbMATH Keywords

approximationbicriterion schedulingresource allocationsingle machine scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39)

Recommendations

• Single machine scheduling problems with resource dependent processing times
• scientific article; zbMATH DE number 1859296
• Single-machine scheduling with time-and-resource-dependent processing times
• Single machine scheduling subject to deadlines and resource dependent processing times
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine

Cited in

(53)

• Single machine batch scheduling with jointly compressible setup and processing times.
• On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
• Resource cost aware scheduling
• Reference points and approximation algorithms in multicriteria discrete optimization
• The resource dependent assignment problem with a convex agent cost function
• Approximate Pareto sets of minimal size for multi-objective optimization problems
• Convex resource allocation for minimizing the makespan in a single machine with job release dates
• Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
• Min-max controllable risk problems
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• Bi-criteria path problem with minimum length and maximum survival probability
• A survey of scheduling with controllable processing times
• Scheduling with controllable release dates and processing times: Makespan minimization
• Scheduling with controllable release dates and processing times: total completion time minimization
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
• 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
• A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
• Parallel machine scheduling with a convex resource consumption function
• Efficiently computing succinct trade-off curves
• A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting
• A decomposition algorithm for nested resource allocation problems
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
• Bicriteria robotic cell scheduling with controllable processing times
• Scheduling with discretely compressible release dates to minimize makespan
• Efficient optimization of many objectives by approximation-guided evolution
• BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS
• Sequencing heuristic for bicriteria scheduling in a single machine problem
• scientific article; zbMATH DE number 3914068 (Why is no real title available?)
• scientific article; zbMATH DE number 1149801 (Why is no real title available?)
• Simple paths with exact and forbidden lengths
• Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost
• SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
• Bicriteria Common Flow Allowance Scheduling with Aging Effect, Convex Resource Allocation, and a Rate-Modifying Activity on a Single Machine
• A note on resource allocation scheduling with position-dependent workloads
• Single-machine common flow allowance scheduling with aging effect, resource allocation, and a rate-modifying activity
• Single machine batch scheduling with resource dependent setup and processing times
• Min‐sum controllable risk problems with concave risk functions of the same value range
• Two‐agent scheduling with linear resource‐dependent processing times
• A multi-objective linear programming model for scheduling part families and designing a group layout in cellular manufacturing systems
• Theory and methodology of time-dependent scheduling: past, present and future
• Minimizing total completion time and makespan for a multi-scenario bi-criteria parallel machine scheduling problem
• Single machine batch scheduling problem with resource dependent setup and processing time in the presence of fuzzy due date
• Bicriteria robotic cell scheduling
• Pre-emptive scheduling problems with controllable processing times
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
• Just-in-time scheduling with controllable processing times on parallel machines
• Scheduling two agents with controllable processing times

This page was built for publication: Bicriterion Single Machine Scheduling with Resource Dependent Processing Times

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