Minimizing maximum delivery completion time for order scheduling with rejection

DOI10.1007/S10878-020-00649-2MaRDI QIDQ830938zbMATH OpenOpenAlexFDO

Authors Ren-Xia Chen, Shisheng Li

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

zbMATH Keywords

approximation algorithmmaximum delivery completion timeorder schedulingrejection

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• One scheduling problem with rejection
• Scheduling with Rejection to Minimize the Makespan
• Order acceptance and scheduling with consideration of service level
• The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
• Scheduling with rejection to minimize the total weighted completion time

Cites work

• A new polynomial-time algorithm for linear programming
• A survey on offline scheduling with rejection
• Algorithms and Data Structures
• An improved heuristic for parallel machine scheduling with rejection
• An order scheduling problem with position-based learning effect
• Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
• Approximation algorithms for precedence-constrained identical machine scheduling with rejection
• Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
• Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps
• Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
• Concurrent open shop scheduling to minimize the weighted number of tardy jobs
• Coordinated scheduling of customer orders for quick response
• Customer order scheduling to minimize the number of late jobs
• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
• Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
• Exact methods for order acceptance and scheduling on unrelated parallel machines
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Improved algorithms for single machine scheduling with release dates and rejections
• Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
• Job selection in a heavily loaded shop
• Metaheuristics for order scheduling problem with unequal ready times
• Minimizing the sum of weighted completion times in a concurrent open shop
• Multiprocessor Scheduling with Rejection
• New approximate algorithms for the customer order scheduling problem with total completion time objective
• Open shops with jobs overlap
• Order acceptance using genetic algorithms
• Order acceptance with weighted tardiness
• Order scheduling in an environment with dedicated resources in parallel
• Order scheduling with tardiness objective: improved approximate solutions
• Parallel-machine scheduling with release dates and rejection
• Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
• Scheduling orders for multiple product types to minimize total weighted completion time
• Scheduling orders for multiple product types with due date related objectives
• Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
• Scheduling with release times and rejection on two parallel machines
• Selecting jobs for heavily loaded shop with lateness penalties
• Single machine scheduling with release dates and rejection
• Single-machine scheduling with production and rejection costs to minimize the maximum earliness
• Tailoring customer order scheduling search algorithms
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• The complexity of customer order scheduling problems on parallel machines
• The one-machine sequencing problem

Cited in

(18)

• Bicriteria order acceptance and scheduling with consideration of fill rate
• Single machine scheduling with rejection and generalized parameters
• Single machine scheduling with rejection to minimize the weighted makespan
• Order acceptance and scheduling with consideration of service level
• 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
• Order acceptance and scheduling with delivery under generalized parameters
• Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection
• An approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties
• Coordinated order scheduling and outsourcing on dedicated parallel machines
• Single machine controllable scheduling with bounded makespan
• Order acceptance and scheduling with weighted makespan
• Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties
• A local search enhanced logic-based benders decomposition approach for order acceptance and scheduling problem with preemption
• Multiple identical serial-batch machines scheduling with release dates and submodular rejection penalties
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
• Single-machine lot scheduling with order rejection
• Approximation algorithms for the parallel-machine customer order scheduling with weighted and submodular rejection penalties

This page was built for publication: Minimizing maximum delivery completion time for order scheduling with rejection

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