Minimizing maximum delivery completion time for order scheduling with rejection (Q830938): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-020-00649-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3084711527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinated scheduling of customer orders for quick response / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor Scheduling with Rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximate algorithms for the customer order scheduling problem with total completion time objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order scheduling with tardiness objective: improved approximate solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job selection in a heavily loaded shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for single machine scheduling with release dates and rejections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics for order scheduling problem with unequal ready times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order scheduling in an environment with dedicated resources in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling orders for multiple product types with due date related objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling orders for multiple product types to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Customer order scheduling to minimize the number of late jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with production and rejection costs to minimize the maximum earliness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of weighted completion times in a concurrent open shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent open shop scheduling to minimize the weighted number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved heuristic for parallel machine scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tailoring customer order scheduling search algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order acceptance using genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on offline scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order acceptance with weighted tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting jobs for heavily loaded shop with lateness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shops with jobs overlap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact methods for order acceptance and scheduling on unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An order scheduling problem with position-based learning effect / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of customer order scheduling problems on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-machine scheduling with release dates and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with release dates and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for precedence-constrained identical machine scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for parallel machine scheduling with release dates and job rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with release times and rejection on two parallel machines / rank
 
Normal rank

Latest revision as of 17:45, 25 July 2024

scientific article
Language Label Description Also known as
English
Minimizing maximum delivery completion time for order scheduling with rejection
scientific article

    Statements

    Minimizing maximum delivery completion time for order scheduling with rejection (English)
    0 references
    0 references
    0 references
    10 May 2021
    0 references
    order scheduling
    0 references
    maximum delivery completion time
    0 references
    rejection
    0 references
    approximation algorithm
    0 references
    0 references

    Identifiers