A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags (Q872246): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1016/j.ejor.2006.06.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984745113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted Lagrangean approach to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The job-shop problem and immediate selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-constrained project scheduling: Notation, classification, models, and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustment of heads and tails for the job-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified shifting bottleneck procedure for job-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling with calendars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-constrained project scheduling: A survey of recent developments. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search algorithms for a single-machine scheduling problem with positive and negative time-lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results on resource-constrained project scheduling with time windows: Models, solution methods, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-based neighborhoods for project scheduling with nonregular objective functions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-machine generalized precedence constrained scheduling problems / rank
 
Normal rank

Latest revision as of 16:36, 25 June 2024

scientific article
Language Label Description Also known as
English
A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags
scientific article

    Statements

    A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags (English)
    0 references
    0 references
    0 references
    27 March 2007
    0 references
    0 references
    scheduling
    0 references
    one machine
    0 references
    makespan
    0 references
    branch and bound algorithm
    0 references
    minimum and maximum time lags
    0 references
    0 references
    0 references