Two-agent scheduling with position-based deteriorating jobs and learning effects
From MaRDI portal
Publication:546060
DOI10.1016/j.amc.2011.04.005zbMath1231.90182MaRDI QIDQ546060
Shuenn-Ren Cheng, Wen-Hsiang Wu, Chin-Chia Wu, Cheng, T. C. Edwin
Publication date: 24 June 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.04.005
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion, Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration, A tabu method for a two-agent single-machine scheduling with deterioration jobs, Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria, A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents, The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect, Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times, A single-machine bi-criterion scheduling problem with two agents, Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent, Two-agent single machine scheduling with forbidden intervals, The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times, A two-agent single-machine scheduling problem to minimize the total cost with release dates, A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms, A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times, Two-agent single-machine scheduling with assignable due dates, A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems, Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs, Scheduling two agents with sum-of-processing-times-based deterioration on a single machine, Single-machine group scheduling problems with deteriorating and learning effect, MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS, A SINGLE-MACHINE TWO-AGENT SCHEDULING PROBLEM BY GA APPROACH
Cites Work
- Optimization by Simulated Annealing
- The complexity of scheduling starting time dependent tasks with release times
- Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities
- A two-machine flowshop problem with two agents
- Comments on ``A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
- A note on the scheduling with two families of jobs
- A bicriteria flowshop scheduling with a learning effect
- A due-date assignment problem with learning effect and deteriorating jobs
- Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan
- Single-machine group scheduling problems with deteriorated and learning effect
- Single-machine scheduling with learning considerations
- The two-machine total completion time flow shop problem
- Single machine scheduling with start time dependent processing times: Some solvable cases
- A concise survey of scheduling with time-dependent processing times
- A note on single-processor scheduling with time-dependent execution times
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Single-machine scheduling with general learning functions
- Some scheduling problems with general position-dependent and time-dependent learning effects
- A multiple-criterion model for machine scheduling
- A state-of-the-art review on scheduling with learning effects
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- A new approach to the learning effect: Beyond the learning curve restrictions
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Scheduling with time dependent processing times: Review and extensions
- Flow-shop scheduling with a learning effect
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- Scheduling Deteriorating Jobs on a Single Processor
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- Single-machine scheduling with a sum-of-actual-processing-time-based learning effect
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Single machine scheduling with a time-dependent learning effect and deteriorating jobs
- Scheduling Problems with Two Competing Agents
- Scheduling start time dependent jobs to minimize the total weighted completion time
- Scheduling jobs with position-dependent processing times
- A note on scheduling problems with learning effect and deteriorating jobs
- Single machine scheduling with learning effect considerations
- Single machine scheduling with step-deteriorating processing times
- Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration
