Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time (Q1679623): 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/s11590-016-1074-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2520498410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with learning considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with learning effect considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with sum-of-logarithm-processing-times based and position based learning effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with past-sequence-dependent setup times and general effects of deterioration and learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with a position-weighted learning effect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with a general exponential learning effect / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof technique for scheduling models with learning effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order acceptance and scheduling with machine availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine group scheduling with general deterioration and learning effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine serial-batching scheduling with independent setup time and deteriorating job processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow-shop scheduling with a learning effect / 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: Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and approximability of scheduling resumable proportionally deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank

Latest revision as of 16:28, 14 July 2024

scientific article
Language Label Description Also known as
English
Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time
scientific article

    Statements

    Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 November 2017
    0 references
    scheduling
    0 references
    availability constraint
    0 references
    serial-batching
    0 references
    single-machine
    0 references
    position-dependent processing time
    0 references

    Identifiers