Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time (Q1617277): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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/s10951-017-0543-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2763446989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with tool changes to minimize total completion time: Basic results and SPT performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with tool changes to minimize total completion time under controllable machining conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On preemption redundancy in scheduling unit processing time jobs on two parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temperature aware online algorithms for scheduling equal length jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of coupled tasks with unit processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due-window assignment problems with unit-time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due-window assignment with identical jobs on parallel uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs / 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: Complexity of integer quasiconvex polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soft due window assignment and scheduling of unit-time jobs on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of incompatible unit-length job families with lookahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling with two GoS levels and unit processing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a variable maintenance and linear deteriorating jobs on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax earliness-tardiness costs with unit processing time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with two competing agents and equal job processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on worst-case performance of heuristics for maintenance scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling the maintenance on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogeneously non-idling schedules of unit-time jobs on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equal processing time bicriteria scheduling on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of two job types on a set of multipurpose machines with unit processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Due dates assignment and JIT scheduling with equal-size jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs under increasing linear machine maintenance time / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:43, 17 July 2024

scientific article
Language Label Description Also known as
English
Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
scientific article

    Statements

    Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time (English)
    0 references
    0 references
    0 references
    7 November 2018
    0 references
    scheduling
    0 references
    tool change
    0 references
    workload-dependent
    0 references
    total completion time
    0 references
    0 references

    Identifiers