The supplying chain scheduling with the cost constraint and subcontracting (Q471714): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59047877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of simple rules for subcontracting in make-to-order manufacturing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed multigraph approach to scheduling jobs on machines of different types<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinating Investment, Production, and Subcontracting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity Acquisition, Subcontracting, and Lot Sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Production-Inventory System with Markovian Capacity and Outsourcing Option / 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: Q4198056 / rank
 
Normal rank

Latest revision as of 06:56, 9 July 2024

scientific article
Language Label Description Also known as
English
The supplying chain scheduling with the cost constraint and subcontracting
scientific article

    Statements

    The supplying chain scheduling with the cost constraint and subcontracting (English)
    0 references
    0 references
    0 references
    17 November 2014
    0 references
    Summary: We propose an analytical scheduling model with subcontracting. Each job can be processed either on a single machine at a manufacturer or outsourced to a subcontractor, possibly at a higher cost. For a given set of jobs, the decisions the manufacturer needs to make include the selection of a subset of jobs to be outsourced and the schedule of all the jobs. The objective functions are to minimize the commonly used scheduling measures, subject to a constraint on the total production and subcontracting cost. We show the NP-hardiness for the problems with different objective functions and develop dynamic programming algorithms for solving them.
    0 references

    Identifiers

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