Single machine scheduling with a generalized job-dependent cumulative effect
From MaRDI portal
Publication:1702657
DOI10.1007/s10951-016-0497-6zbMath1386.90063OpenAlexW2523620715MaRDI QIDQ1702657
Kabir Rustogi, Vitaly A. Strusevich
Publication date: 28 February 2018
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: http://gala.gre.ac.uk/id/eprint/20040/7/20040%20STRUSEVICH_Single_Machine_Scheduling_2016.pdf
single machinemaintenanceprecedence constraintsdeteriorationapproximation schemehalf-product problem
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Cites Work
- Unnamed Item
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
- Time-dependent scheduling
- FPTAS for half-products minimization with scheduling applications
- Scheduling jobs under decreasing linear deterioration
- Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
- Machine scheduling with a rate-modifying activity
- Single machine scheduling with precedence constraints and positionally dependent processing times
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- Machine scheduling problems with a position-dependent deterioration
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
- Some scheduling problems with general position-dependent and time-dependent learning effects
- Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Minimization of Half-Products
- MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK
- Sequencing with Series-Parallel Precedence Constraints
- The Recognition of Series Parallel Digraphs
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Multiagent Scheduling