Minimizing maximum delivery completion time for order scheduling with rejection
From MaRDI portal
Publication:830938
DOI10.1007/s10878-020-00649-2zbMath1468.90047OpenAlexW3084711527MaRDI QIDQ830938
Publication date: 10 May 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00649-2
Related Items
Single machine scheduling with rejection and generalized parameters, Single machine scheduling with rejection to minimize the weighted makespan, Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost, Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan, Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection
Cites Work
- Unnamed Item
- Improved algorithms for single machine scheduling with release dates and rejections
- Parallel-machine scheduling with release dates and rejection
- Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
- An order scheduling problem with position-based learning effect
- A survey on offline scheduling with rejection
- Minimizing the sum of weighted completion times in a concurrent open shop
- Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
- A new polynomial-time algorithm for linear programming
- Order acceptance with weighted tardiness
- Order scheduling in an environment with dedicated resources in parallel
- Scheduling orders for multiple product types to minimize total weighted completion time
- Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
- Order acceptance using genetic algorithms
- Single machine scheduling with release dates and rejection
- The one-machine sequencing problem
- Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps
- Open shops with jobs overlap
- Job selection in a heavily loaded shop
- Concurrent open shop scheduling to minimize the weighted number of tardy jobs
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
- New approximate algorithms for the customer order scheduling problem with total completion time objective
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- Metaheuristics for order scheduling problem with unequal ready times
- Order scheduling with tardiness objective: improved approximate solutions
- The complexity of customer order scheduling problems on parallel machines
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
- Tailoring customer order scheduling search algorithms
- Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
- Scheduling with release times and rejection on two parallel machines
- Customer order scheduling to minimize the number of late jobs
- Single-machine scheduling with production and rejection costs to minimize the maximum earliness
- Selecting jobs for heavily loaded shop with lateness penalties
- Scheduling orders for multiple product types with due date related objectives
- An improved heuristic for parallel machine scheduling with rejection
- Coordinated scheduling of customer orders for quick response
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Multiprocessor Scheduling with Rejection
- Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
- Algorithms and Data Structures
