SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
From MaRDI portal
Publication:4649880
DOI10.1142/S0217595912500303zbMath1251.90198MaRDI QIDQ4649880
Ping Ji, Ji-Bo Wang, Ming-Zheng Wang
Publication date: 15 November 2012
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Related Items (12)
Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects ⋮ Single-machine group scheduling with processing times dependent on position, starting time and allotted resource ⋮ Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times ⋮ A note on resource allocation scheduling with position-dependent workloads ⋮ Due-window assignment scheduling problems with position-dependent weights on a single machine ⋮ Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times ⋮ Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights ⋮ Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration ⋮ A unified analysis for scheduling problems with variable processing times ⋮ Single-Machine Scheduling Problems with Variable Processing Times and Past-Sequence-Dependent Delivery Times ⋮ MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS ⋮ A NOTE ON "SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING"
Cites Work
- Unnamed Item
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
- A survey of results for sequencing problems with controllable processing times
- Time-dependent scheduling
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- Learning effect and deteriorating jobs in the single machine scheduling problems
- A unified approach for scheduling with convex resource consumption functions using positional penalties
- Resource level minimization in the discrete-continuous scheduling
- Single-machine scheduling with learning considerations
- Single-machine sequencing with controllable processing times
- Single machine scheduling subject to deadlines and resource dependent processing times
- Scheduling jobs under simple linear deterioration
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- A concise survey of scheduling with time-dependent processing times
- A permutation flow-shop scheduling problem with convex models of operation processing times
- Minimizing the total weighted completion time of deteriorating jobs
- A survey of scheduling with controllable processing times
- A state-of-the-art review on scheduling with learning effects
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Batching work and rework processes with limited deterioration of reworkables
- Scheduling with time dependent processing times: Review and extensions
- Common due window size and location determination in a single machine scheduling problem
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Minimizing Variation of Flow Time in Single Machine Systems
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Resource optimal control in some single-machine scheduling problems
- Single machine sequencing with linear models of release dates
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- Scheduling jobs with position-dependent processing times
- Single Machine Scheduling with Flow Allowances
This page was built for publication: SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
