Scheduling jobs with piecewise linear decreasing processing times
From MaRDI portal
Publication:4456082
DOI10.1002/nav.10073zbMath1043.90027MaRDI QIDQ4456082
Cheng, T. C. Edwin, Aleksander Bachman, Adam Janiak, Mikhail Y. Kovalyov, Qing Ding
Publication date: 15 March 2004
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.10073
90B35: Deterministic scheduling theory in operations research
Related Items
Partial dominated schedules and minimizing the total completion time of deteriorating jobs, A single-machine scheduling with a truncated linear deterioration and ready times, Single-machine scheduling with deteriorating functions for job processing times, A branch and bound algorithm for single machine scheduling with deteriorating values of jobs, Scheduling problems with general effects of deterioration and learning, Single-machine scheduling with a nonlinear deterioration function, Some single-machine and flowshop scheduling problems with a non-linear deterioration function, Single-machine scheduling with nonlinear deterioration, Preemptive repayment policy for multiple loans, An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan, A concise survey of scheduling with time-dependent processing times, Single-machine scheduling with logarithm deterioration, Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs, Single-machine scheduling with both deterioration and learning effects, A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs, Single-machine group scheduling problems with deterioration consideration, A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION
Cites Work
