Preemptive scheduling in a two-stage supply chain to minimize the makespan (Q3458814): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/oms/PeiFPLGY15, #quickstatements; #temporary_batch_1731483406851
 
(4 intermediate revisions by 4 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.1080/10556788.2014.969262 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979637415 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57439534 / 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: Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: How useful are preemptive schedules? / 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: Single machine scheduling and due date assignment with positionally dependent processing times / 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: Preemptive scheduling of equal length jobs with release dates on two uniform parallel 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: Single-machine batch scheduling minimizing weighted flow times and delivery costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling with simple linear deterioration on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving job shop scheduling problems utilizing the properties of backbone and ``big valley'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic algorithm for the machine scheduling problem with job delivery coordination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic approach to a single stage assembly problem with transportation allocation / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/oms/PeiFPLGY15 / rank
 
Normal rank

Latest revision as of 09:14, 13 November 2024

scientific article
Language Label Description Also known as
English
Preemptive scheduling in a two-stage supply chain to minimize the makespan
scientific article

    Statements

    Preemptive scheduling in a two-stage supply chain to minimize the makespan (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 December 2015
    0 references
    batch scheduling
    0 references
    supply chain
    0 references
    preemption
    0 references
    transportation
    0 references
    release time
    0 references
    set-up time
    0 references

    Identifiers