Single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times
From MaRDI portal
Publication:3455877
DOI10.1142/S0217595915500335zbMATH Open1330.90032MaRDI QIDQ3455877FDOQ3455877
Jian-Jun Wang, Xue-Ru Wang, Xinjun Li
Publication date: 11 December 2015
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Recommendations
- Single-machine scheduling with convex resource dependent processing times and deteriorating jobs
- Single machine scheduling with learning effect and controllable deteriorating jobs
- Single-machine scheduling resource-dependent deteriorating jobs with a learning effect
- Single machine scheduling problems with learning effect and resource-dependence
- Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects
Cites Work
- A survey of scheduling with controllable processing times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Four single-machine scheduling problems involving due date determination decisions
- Single-machine group scheduling with general deterioration and learning effects
- Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine
- Time-dependent scheduling
- A state-of-the-art review on scheduling with learning effects
- Due-date assignment and single machine scheduling with deteriorating jobs
- Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects
- Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects
- Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs
- Single-machine scheduling with nonlinear deterioration
- Single-machine scheduling with learning considerations
- Flowshop scheduling with a general exponential learning effect
- Single Machine Scheduling with Flow Allowances
- Minimizing total tardiness on a single machine with controllable processing times
- Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
- The single-machine total weighted tardiness scheduling problem with position-based learning effects
- Some scheduling problems with general position-dependent and time-dependent learning effects
- Single-machine scheduling with time-and-resource-dependent processing times
- Single-machine scheduling with convex resource dependent processing times and deteriorating jobs
- A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
- Single machine scheduling problems with controllable processing times and total absolute differences penalties
- Single machine scheduling with a time-dependent learning effect and deteriorating jobs
- A revision of machine scheduling problems with a general learning effect
- A due-date assignment problem with learning effect and deteriorating jobs
- Some single-machine scheduling problems with general effects of learning and deterioration
- Parallel machines scheduling with deteriorating and learning effects
- A unified approach for scheduling with convex resource consumption functions using positional penalties
- 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
- Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires
- A branch and bound algorithm for single machine scheduling with deteriorating values of jobs
- SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
- Single-machine sequencing with controllable processing times
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
- A note on ``Scheduling problems with the effects of deterioration and learning
Cited In (13)
- A Bicriteria Approach for Single Machine Scheduling with Resource Allocation, Learning Effect and a Deteriorating Maintenance Activity
- Single Machine Two-Agent Scheduling with Deteriorating Jobs
- Single machine scheduling with a time-dependent learning effect and deteriorating jobs
- An Optimal Online Algorithm for Scheduling with Learning Consideration
- A unified analysis for scheduling problems with variable processing times
- Title not available (Why is that?)
- Scheduling with deteriorating jobs and non-simultaneous machine available times
- Scheduling jobs with general truncated learning effects including proportional setup times
- Permutation flow shop problem with shortening job processing times
- Study on resource allocation scheduling problem with learning factors and group technology
- A note on resource allocation scheduling with position-dependent workloads
- Single-Machine Scheduling Problems with Variable Processing Times and Past-Sequence-Dependent Delivery Times
- Title not available (Why is that?)
This page was built for publication: Single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455877)