A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates (Q2430605): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s10479-010-0746-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995288952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-machine scheduling with earliness, tardiness and completion time penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Search Procedure for Hamilton Paths and Circuits / 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: Q3741388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling problem with a common deadline and resource dependent release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on minimizing maximum lateness in a one-machine sequencing problem with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex resource allocation for minimizing the makespan in a single machine with job release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the total weighted flow time in a single machine with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with a convex resource consumption function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis / rank
 
Normal rank

Latest revision as of 23:34, 3 July 2024

scientific article
Language Label Description Also known as
English
A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
scientific article

    Statements

    A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates (English)
    0 references
    0 references
    0 references
    0 references
    8 April 2011
    0 references
    0 references
    scheduling
    0 references
    single machine
    0 references
    controllable processing times
    0 references
    convex resource consumption function
    0 references
    0 references
    0 references