A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs

DOI10.1016/J.COR.2010.12.010zbMATH Open1208.90080OpenAlexW2054771140MaRDI QIDQ632684FDOQ632684

Authors: M. Duran Toksarı 

Publication date: 25 March 2011

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

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

Recommendations

• A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times
• Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
• Tri-criteria single machine scheduling model with release times and learning factor
• A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
• Scheduling with a position-weighted learning effect and job release dates

zbMATH Keywords

schedulingsingle machine schedulingmakespanlearning effectdeterioration jobsrelease times

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
• Single-machine group scheduling problems with deteriorated and learning effect
• Single-machine scheduling with learning considerations
• Scheduling problems with a learning effect
• Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
• Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
• Scheduling jobs under simple linear deterioration
• Single-machine scheduling problems with both deteriorating jobs and learning effects
• A due-date assignment problem with learning effect and deteriorating jobs
• Some single-machine scheduling problems with general effects of learning and deterioration
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• V-Shaped Policies for Scheduling Deteriorating Jobs
• Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
• Scheduling start time dependent jobs to minimize the total weighted completion time

Cited In (17)

• Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration
• Tri-criteria single machine scheduling model with release times and learning factor
• Joint reply to the erratum and the note on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
• Total tardiness minimization in permutation flowshop with deterioration consideration
• A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times
• A makespan minimization problem for versatile developers in the game industry
• A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine
• Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect
• Note on a single-machine scheduling problem with sum of processing times based learning and ready times
• Single-machine group scheduling problems with variable job processing times
• The single-machine total tardiness problem with unequal release times and a linear deterioration
• A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
• Optimizing the supply chain configuration for make-to-order manufacturing
• Single-machine scheduling with learning and forgetting effects
• Solving a two-agent single-machine scheduling problem considering learning effect
• Scheduling identical serial-batching machines in the engine manufacturing supply chain by an integrated variable neighborhood search Algorithm
• A genetic algorithm-based approach for single-machine scheduling with learning effect and release time

This page was built for publication: A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs

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