Scheduling batch processing machines with incompatible job families (Q4399080): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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.1080/00207549508904839 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092068825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching and Scheduling Jobs on Batch and Discrete Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total completion time on a batch processing machine with job families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal control of batch service queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient scheduling algorithms for a single batch processing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3899811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new dynamic programming algorithm for the parallel machines total weighted completion time problem / 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: Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times / 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: Scheduling a single batch processing machine with non-identical job sizes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:25, 28 May 2024

scientific article; zbMATH DE number 1179759
Language Label Description Also known as
English
Scheduling batch processing machines with incompatible job families
scientific article; zbMATH DE number 1179759

    Statements

    Scheduling batch processing machines with incompatible job families (English)
    0 references
    0 references
    30 March 1999
    0 references
    single batch processing machine
    0 references
    incompatible job families
    0 references
    makespan
    0 references
    maximum lateness
    0 references
    neuristics
    0 references

    Identifiers