Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times (Q5865923): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Problems with Two Competing Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine parallel batch scheduling subject to precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-criteria scheduling on a single parallel-batch machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Pareto minimizing total completion time and maximum cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded parallel-batch scheduling with drop-line tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on unbounded parallel-batch scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded parallel-batching scheduling with two competitive agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scheduling an unbounded batch machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal methods for batch processing problem with makespan and maximum lateness objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online over time scheduling on parallel-batch machines: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3378953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with release dates and preemption to minimize multiple max-form objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0217595921500238 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3160324153 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:24, 30 July 2024

scientific article; zbMATH DE number 7539543
Language Label Description Also known as
English
Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times
scientific article; zbMATH DE number 7539543

    Statements

    Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times (English)
    0 references
    0 references
    10 June 2022
    0 references
    0 references
    parallel-batch scheduling
    0 references
    release dates
    0 references
    Pareto optimization
    0 references
    polynomial-time algorithm
    0 references
    0 references
    0 references