Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Modeling the parallel machine scheduling problem with step deteriorating jobs
Scheduling with time-changing effects and rate-modifying activities
Models and algorithms of time-dependent scheduling
Minimizing total weighted completion time in a proportionate flow shop
On a scheduling problem of time deteriorating jobs
Single machine scheduling with start time dependent processing times: Some solvable cases
A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times
A review of four decades of time-dependent scheduling: main results, new topics, and open problems
Scheduling with step-deteriorating jobs to minimize the makespan
Optimal two- and three-stage production schedules with set-up time included
Integer Programming with a Fixed Number of Variables
Algorithms for Scheduling Independent Tasks
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
The Complexity of Flowshop and Jobshop Scheduling
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Scheduling deteriorating jobs to minimize makespan
Makespan minimization in single-machine scheduling with step-deterioration of processing times
Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
Scheduling
Single machine scheduling with step-deteriorating processing times

This page was built for publication: Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6577340)