Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm (Q2795178): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57432779, #quickstatements; #temporary_batch_1706814575051
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Xin-Bao Liu / rank
Normal rank
 
Property / author
 
Property / author: Panos M. Pardalos / rank
Normal rank
 
Property / author
 
Property / author: Shan-Lin Yang / rank
Normal rank
 
Property / author
 
Property / author: Xin-Bao Liu / rank
 
Normal rank
Property / author
 
Property / author: Panos M. Pardalos / rank
 
Normal rank
Property / author
 
Property / author: Shan-Lin Yang / rank
 
Normal rank
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.1080/00207721.2014.902553 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985556834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The significance of reducing setup times/setup costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line supply chain scheduling problems with preemption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search and lower bounds for a combined production-transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel batch scheduling of equal-length jobs with release and due dates / 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: Supply Chain Scheduling: Batching and Delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan with release times on identical parallel batching machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4290987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving single batch-processing machine problems using an iterated heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization on single batch-processing machine via ant colony optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a hybrid flowshop with batch production at the last stage / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:11, 11 July 2024

scientific article
Language Label Description Also known as
English
Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm
scientific article

    Statements

    Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 March 2016
    0 references
    supply chain scheduling
    0 references
    release times
    0 references
    batching
    0 references
    heuristic algorithm
    0 references
    worst case analysis
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references