Single machine scheduling with start time dependent processing times: Some solvable cases
From MaRDI portal
Publication:1342026
DOI10.1016/0377-2217(94)90048-5zbMath0816.90088OpenAlexW2012767650MaRDI QIDQ1342026
P. S. Sundararaghavan, Anand S. Kunnathur
Publication date: 11 January 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90048-5
Quadratic programming (90C20) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)
Related Items
Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration, A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration, Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines, Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs, Single machine scheduling with start time dependent processing times: Some solvable cases, Complexity analysis of job-shop scheduling with deteriorating jobs, Minimizing total completion time in a two-machine flow shop with deteriorating jobs, Modeling the parallel machine scheduling problem with step deteriorating jobs, A tabu method for a two-agent single-machine scheduling with deterioration jobs, Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness, Parallel machine scheduling with time dependent processing times, A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration, Single machine quadratic penalty function scheduling with deteriorating jobs and group technology, Single-machine scheduling with deteriorating functions for job processing times, Parallel-Machine Scheduling with Step-Deteriorating Jobs to Minimize the Total (Weighted) Completion Time, Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration, Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs, A concise survey of scheduling with time-dependent processing times, A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs, Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs, Single-machine scheduling with a nonlinear deterioration function, Some single-machine and flowshop scheduling problems with a non-linear deterioration function, Single machine group scheduling under decreasing linear deterioration, Single-machine group scheduling problems with deterioration consideration, A single-machine scheduling with a truncated linear deterioration and ready times, A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION, Single-machine scheduling with deteriorating jobs, A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times, Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint, Scheduling linear deteriorating jobs with rejection on a single machine, Scheduling of deteriorating jobs with release dates to minimize the maximum lateness, Minimizing maximum lateness under linear deterioration, Learning effect and deteriorating jobs in the single machine scheduling problems, Two-agent scheduling with position-based deteriorating jobs and learning effects, A note on scheduling problems with learning effect and deteriorating jobs, Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration, Single machine scheduling with step-deteriorating processing times, A note on single-machine makespan scheduling with deteriorating jobs and scheduled maintenance, Single machine parallel-batch scheduling with deteriorating jobs, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, Preemptive repayment policy for multiple loans, The time-dependent rural postman problem: polyhedral results, SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
Cites Work
- Unnamed Item
- Unnamed Item
- Single machine scheduling with start time dependent processing times: Some solvable cases
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time
