Single machine multiple common due dates scheduling with learning effects

From MaRDI portal
Publication:630690


DOI10.1016/j.camwa.2010.09.061zbMath1207.90059MaRDI QIDQ630690

Ming-Zheng Wang, Ji-Bo Wang

Publication date: 19 March 2011

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2010.09.061


90B35: Deterministic scheduling theory in operations research


Related Items

Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects, Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity, Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints, Single-machine scheduling with learning and forgetting effects, Scheduling jobs with truncated exponential learning functions, Single-machine group scheduling with general deterioration and learning effects, A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects, Some single-machine and flowshop scheduling problems with a non-linear deterioration function, Single machine scheduling with multiple common due date assignment and aging effect under a deteriorating maintenance activity consideration, The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times, Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning, Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects, Two-agent single-machine scheduling with assignable due dates, Single machine scheduling problem with multiple due windows assignment in a group technology, Optimal due-date assignment problem with learning effect and resource-dependent processing times, Single machine scheduling with sum-of-logarithm-processing-times based and position based learning effects, Single machine scheduling with exponential learning functions, Multiple common due-dates assignment and optimal maintenance activity scheduling with linear deteriorating jobs, Common Due-Window Assignment and Group Scheduling with Position-Dependent Processing Times



Cites Work