The job shop scheduling problem with convex costs (Q1754305): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2018.01.027 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LSTF / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2793396949 / 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: Minimizing Job Idleness in Deadline Constrained Environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Convex Cost Integer Dual Network Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine match-up scheduling with manufacturing cost considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided Local Search with Shifting Bottleneck for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian bounds for just-in-time job-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid approach to scheduling with earliness and tardiness costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended GRASP for the job shop scheduling problem with total weighted tardiness objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing and scheduling in a flexible job shop by tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job shop scheduling with a non-regular objective: A comparison of neighbourhood structures based on a sequencing/timing decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear programming-based method for job shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neighborhood for complex job shop scheduling problems with regular objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: The blocking job shop with rail-bound transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The no-wait job shop with regular objective: a method based on optimal job insertion / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternative framework to Lagrangian relaxation approach for job shop scheduling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted tardiness in a generalized job shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing lower and upper bounds for a large-scale industrial job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dantzig-Wolfe Decomposition for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics for the single machine weighted quadratic tardiness scheduling problem / 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: Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The flexible blocking job shop with transfer and set-up times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search algorithms for job-shop problems with a single transport robot / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic job-shop scheduling: Past, present and future / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-shop scheduling with processing alternatives. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A large step random walk for minimizing total weighted tardiness in a job shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general approach for optimizing regular criteria in the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced production scheduling for batch plants in process industries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Taboo Search Algorithm for the Job Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An advanced tabu search algorithm for the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search/path relinking algorithm to solve the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4238569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blood Inventory Management: An Overview of Theory and Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Focused simulated annealing search: An application to job shop scheduling / 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: Scheduling Multiple Variable-Speed Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Local Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timing problems and algorithms: Time decisions for sequences of activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact, Heuristic and Meta-heuristic Algorithms for Solving Shop Scheduling Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2018.01.027 / rank
 
Normal rank

Latest revision as of 08:26, 11 December 2024

scientific article
Language Label Description Also known as
English
The job shop scheduling problem with convex costs
scientific article

    Statements

    The job shop scheduling problem with convex costs (English)
    0 references
    0 references
    0 references
    30 May 2018
    0 references
    scheduling
    0 references
    job shop
    0 references
    non-regular objective
    0 references
    convex costs
    0 references
    tabu search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers