Scheduling with time-dependent discrepancy times
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- A Dynamic Programming Approach to Sequencing Problems
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A classification of assembly line balancing problems
- A concise survey of scheduling with time-dependent processing times
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
- A state-of-the-art review on scheduling with learning effects
- An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
- An exact algorithm for single-machine scheduling without machine idle time
- Ant algorithms for a time and space constrained assembly line balancing problem
- Balancing and scheduling tasks in assembly lines with sequence-dependent setup times
- Complexity of single machine hierarchical scheduling: A survey
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
- Minimizing Total Tardiness on One Machine is NP-Hard
- Minimizing the average deviation of job completion times about a common due date
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- New exact algorithms for one-machine earliness-tardiness scheduling
- On a scheduling problem of time deteriorating jobs
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Optimization of workcell layouts in a mixed-model assembly line environment
- Part logistics in the automotive industry: decision problems, literature review and research agenda
- Preemption in single machine earliness/tardiness scheduling
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling deteriorating jobs to minimize makespan
- Scheduling jobs with piecewise linear decreasing processing times
- Scheduling problems with learning and ageing effects: a survey
- Scheduling with time dependent processing times: Review and extensions
- Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Time-dependent scheduling
Cited in
(7)- On scheduling with ready-times, due-dates and vacations
- A comparison of algorithms for finding an efficient theme park tour
- Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time
- On the complexity of scheduling tasks with discrete starting times
- Scheduling jobs with a V-shaped time-dependent processing time
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Scheduling with time-changing effects and rate-modifying activities
This page was built for publication: Scheduling with time-dependent discrepancy times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702735)
