Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
From MaRDI portal
Publication:611621
DOI10.1016/j.apm.2010.03.014zbMath1201.90090MaRDI QIDQ611621
Publication date: 14 December 2010
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2010.03.014
90B35: Deterministic scheduling theory in operations research
Related Items
Single-machine bicriterion group scheduling with deteriorating setup times and job processing times, Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan, The third comprehensive survey on scheduling problems with setup times/costs, A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties, Single-machine scheduling with learning and forgetting effects, Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs, Single machine group scheduling with decreasing time-dependent processing times subject to release dates, Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties, A single machine scheduling problem with availability constraints and sequence-dependent setup costs, Single-machine scheduling with deteriorating functions for job processing times, Single machine group scheduling with time dependent processing times and ready times, Two-machine flow shop total tardiness scheduling problem with deteriorating jobs, Single-machine group scheduling problems with deterioration to minimize the sum of completion times, Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs, Single machine serial-batching scheduling with independent setup time and deteriorating job processing times, Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time, Scheduling two agents with sum-of-processing-times-based deterioration on a single machine, Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration
Cites Work
- Flow shop scheduling problems with decreasing linear deterioration under dominant machines
- Time-dependent scheduling
- Scheduling jobs under decreasing linear deterioration
- Scheduling jobs under simple linear deterioration
- Single machine scheduling with start time dependent processing times: Some solvable cases
- Complexity analysis of job-shop scheduling with deteriorating jobs
- A concise survey of scheduling with time-dependent processing times
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time
- Parallel machine scheduling with time dependent processing times
- Single-machine group scheduling problems with deterioration consideration
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- The Single Machine Problem with a Quadratic Cost Function of Completion Times
- V-Shaped Policies for Scheduling Deteriorating Jobs
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- Minimizing a Quadratic Cost Function of Waiting Times in Single-Machine Scheduling
- Flow shop scheduling problems with deteriorating jobs under dominating machines
- Multi-Machine Scheduling With Linear Deterioration
