Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem

DOI10.1155/2016/6591632zbMath1400.90165OpenAlexW2553786100WikidataQ58839247 ScholiaQ58839247MaRDI QIDQ1793464

Mohammed Al-Salem, Leonardo Bedoya-Valencia, Ghaith Rabadi

Publication date: 12 October 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2016/6591632

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Related Items

A meta-heuristic to solve the just-in-time job-shop scheduling problem

Cites Work

• Unnamed Item
• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
• Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics
• Two-machine flow shop scheduling with nonregular criteria
• Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
• A V-shape property of optimal schedule of jobs about a common due date
• Equivalence of mean flow time problems and mean absolute deviation problems
• Scheduling around a small common due date
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Variable neighbourhood search and mathematical programming for just-in-time job-shop scheduling problem
• Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
• On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
• A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
• Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
• Lagrangian bounds for just-in-time job-shop scheduling
• Permutation flow shop scheduling with earliness and tardiness penalties
• A Meta-RaPS for the early/tardy single machine scheduling problem
• Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single CNC machine scheduling with controllable processing times and multiple due dates
• Minimizing mean absolute deviation of completion times about a common due date
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• Scheduling unit processing time jobs on an m-machine flow-shop
• Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
• Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date