Scheduling Deteriorating Jobs on a Single Processor
From MaRDI portal
Publication:3483073
DOI10.1287/opre.38.3.495zbMath0703.90051OpenAlexW2137958320MaRDI QIDQ3483073
Publication date: 1990
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.38.3.495
Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05)
Related Items (only showing first 100 items - show all)
Scheduling jobs under simple linear deterioration ⋮ Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration ⋮ The complexity of scheduling starting time dependent tasks with release times ⋮ Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation ⋮ Parallel-machine scheduling of simple linear deteriorating jobs ⋮ Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs ⋮ Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration ⋮ Complexity analysis of job-shop scheduling with deteriorating jobs ⋮ An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan ⋮ A note on scheduling on a single processor with speed dependent on a number of executed jobs ⋮ Minimizing total completion time in a two-machine flow shop with deteriorating jobs ⋮ Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects ⋮ A tabu method for a two-agent single-machine scheduling with deterioration jobs ⋮ Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan ⋮ Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities ⋮ A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine ⋮ How to collect balls moving in the Euclidean plane ⋮ Flow shop scheduling problems with decreasing linear deterioration under dominant machines ⋮ A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs ⋮ Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness ⋮ Single machine problem with multi-rate-modifying activities under a time-dependent deterioration ⋮ Parallel-machine scheduling problems with past-sequence-dependent delivery times and aging maintenance ⋮ Parallel-machine scheduling with time-dependent and machine availability constraints ⋮ A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents ⋮ Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration ⋮ Online scheduling of simple linear deteriorating jobs to minimize the total general completion time ⋮ A single-machine scheduling problem with two-agent and deteriorating jobs ⋮ Single machine quadratic penalty function scheduling with deteriorating jobs and group technology ⋮ Single-machine scheduling with deteriorating functions for job processing times ⋮ A branch and bound algorithm for single machine scheduling with deteriorating values of jobs ⋮ Approximation algorithms for parallel machine scheduling with linear deterioration ⋮ Impact of job-sequence on the down-time of a deteriorating flexible machine ⋮ Patients scheduling problems with deferred deteriorated functions ⋮ Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration ⋮ A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints ⋮ Some single-machine scheduling problems with general effects of learning and deterioration ⋮ Scheduling problems with general effects of deterioration and learning ⋮ A concise survey of scheduling with time-dependent processing times ⋮ Scheduling with time-dependent discrepancy times ⋮ An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration ⋮ Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection ⋮ 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 ⋮ Single-machine due-window assignment problem with learning effect and deteriorating jobs ⋮ Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs ⋮ New results on single-machine scheduling with past-sequence-dependent delivery times ⋮ Single-machine scheduling problems with time and position dependent processing times ⋮ Scheduling on parallel identical machines with job-rejection and position-dependent processing times ⋮ Single-machine scheduling with past-sequence-dependent delivery times and release times ⋮ Uniform parallel-machine scheduling with time dependent processing times ⋮ Multi-machine scheduling with interval constrained position-dependent processing times ⋮ Scheduling a variable maintenance and linear deteriorating jobs on a single machine ⋮ Scheduling simple linear deteriorating jobs with rejection ⋮ Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption ⋮ Minimizing the makespan for scheduling problems with general deterioration effects ⋮ Considerations of single-machine scheduling with deteriorating jobs ⋮ Scheduling with deteriorating jobs and learning effects ⋮ Single-machine scheduling with a nonlinear deterioration function ⋮ Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times ⋮ Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine ⋮ Some single-machine and flowshop scheduling problems with a non-linear deterioration function ⋮ Online scheduling with linear deteriorating jobs to minimize the total weighted completion time ⋮ Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities ⋮ A single-machine scheduling with a truncated linear deterioration and ready times ⋮ Scheduling on a single processor with variable speed ⋮ Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine ⋮ Flow shop scheduling with effects of learning and deterioration ⋮ Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration ⋮ Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times ⋮ Scheduling linear deteriorating jobs with rejection on a single machine ⋮ Dynamic priority rules when polling with multiple parallel servers ⋮ Scheduling linear deteriorating jobs to minimize the number of tardy jobs ⋮ Learning effect and deteriorating jobs in the single machine scheduling problems ⋮ Scheduling deteriorating jobs on a single machine subject to breakdowns ⋮ Rescheduling problems with deteriorating jobs under disruptions ⋮ A due-date assignment problem with learning effect and deteriorating jobs ⋮ Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning ⋮ Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning ⋮ Two-agent scheduling with position-based deteriorating jobs and learning effects ⋮ Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness ⋮ Single-machine group scheduling problems with deteriorated and learning effect ⋮ Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times ⋮ Two-agent single-machine scheduling problems under increasing linear deterioration ⋮ The Browne-Yechiali single-machine sequence is optimal for flow-shops ⋮ A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times ⋮ Preemptive scheduling with simple linear deterioration on a single machine ⋮ Parallel-machine scheduling with deteriorating jobs and rejection ⋮ Single machine scheduling with decreasing linear deterioration under precedence constraints ⋮ Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs ⋮ Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates ⋮ Single machine parallel-batch scheduling with deteriorating jobs ⋮ Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration ⋮ A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times ⋮ Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine ⋮ On a scheduling problem of time deteriorating jobs ⋮ Preemptive repayment policy for multiple loans ⋮ Job sequencing rules for minimizing the expected makespan in flexible machines ⋮ Scheduling jobs under decreasing linear deterioration ⋮ A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem ⋮ Minimizing the total weighted completion time of deteriorating jobs
This page was built for publication: Scheduling Deteriorating Jobs on a Single Processor