Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation (Q5059190): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q129158418, #quickstatements; #temporary_batch_1724714016629
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/0305215x.2018.1519557 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2897353798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling with Flow Allowances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiagent Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with job-rejection and position-dependent processing times on proportionate flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection / 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: A survey on scheduling problems with due windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on resource allocation scheduling with position-dependent workloads / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a deteriorating maintenance activity and due-window assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax scheduling problems with a common due-window / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling problems with position dependent job processing times: computational complexity results / 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: Research on permutation flow shop scheduling problems with general position-dependent learning effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129158418 / rank
 
Normal rank

Latest revision as of 01:23, 27 August 2024

scientific article; zbMATH DE number 7637040
Language Label Description Also known as
English
Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
scientific article; zbMATH DE number 7637040

    Statements

    Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation (English)
    0 references
    0 references
    23 December 2022
    0 references
    0 references
    single-machine scheduling
    0 references
    minmax
    0 references
    common due-window
    0 references
    convex resource allocation
    0 references
    position-dependent workloads
    0 references
    0 references
    0 references
    0 references