A note on batch scheduling on a two-machine flowshop with machine-dependent processing times (Q6054015): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10288-022-00519-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4288444188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching identical jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling on two-machine flowshop with machine-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Scheduling of Products with Two Subassemblies on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching to Minimize Flow Times on One Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriterion scheduling with equal processing times on a batch processing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine batch scheduling with two competing agents to minimize total flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on flow-shop and job-shop batch scheduling with identical processing-time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with batch-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A single machine batch scheduling problem with bounded batch size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open-shop batch scheduling with identical jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling on a two-machine jobshop with machine-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow-shop batch scheduling with identical processing-time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing flow-time on a single machine with integer batch sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-pass batching algorithms for the one-machine problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching and scheduling in a multi-machine flow shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching in single operation manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for a one machine batching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:40, 3 August 2024

scientific article; zbMATH DE number 7753790
Language Label Description Also known as
English
A note on batch scheduling on a two-machine flowshop with machine-dependent processing times
scientific article; zbMATH DE number 7753790

    Statements

    A note on batch scheduling on a two-machine flowshop with machine-dependent processing times (English)
    0 references
    0 references
    0 references
    0 references
    24 October 2023
    0 references
    0 references
    scheduling
    0 references
    batching
    0 references
    flow-shop
    0 references
    makespan
    0 references
    batch availability
    0 references
    machine-dependent processing times
    0 references
    0 references
    0 references