Two-machine job-shop scheduling with one joint job

DOI10.1016/j.dam.2023.11.037MaRDI QIDQ6153460

No author found.

Publication date: 14 February 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingjob-shop schedulingtransportation timemachine repetitiontwo-pointers method

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient algorithm for the job-shop problem with two jobs
• The complexity of shop-scheduling problems with two or three jobs
• The job shop scheduling problem: Conventional and new solution techniques
• A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
• On the complexity of two machine job-shop scheduling with regular objective functions
• Guide to competitive programming. Learning and improving algorithms through contests
• Deterministic job-shop scheduling: Past, present and future
• On the complexity of non-preemptive shop scheduling with two jobs
• NP-hardness of shop-scheduling problems with three jobs
• A survey of job shop scheduling problem: the types and models
• Complexity of shop-scheduling problems with fixed number of jobs: a survey
• Logistics scheduling with batching and transportation
• A hybrid genetic algorithm for the job shop scheduling problem
• Optimal two- and three-stage production schedules with setup times included
• An Algorithm for Solving the Job-Shop Problem
• The Complexity of Flowshop and Jobshop Scheduling
• Job Shop Scheduling With Two Jobs And Nonregular Objective Functions
• Scheduling
• Flexible job-shop scheduling with transportation resources

This page was built for publication: Two-machine job-shop scheduling with one joint job