Permutation flow shop scheduling with earliness and tardiness penalties

DOI10.1080/00207540802124301zbMath1198.90172OpenAlexW2065561655MaRDI QIDQ3055278

Devanath Tirupati, Peeyush Mehta, Pankaj Chandra

Publication date: 7 November 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://web.iima.ac.in/assets/snippets/workingpaperpdf/2004-07-06pankajchandra.pdf

zbMATH Keywords

earlinessflow shopcommon due datetardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Using hybrid GA-PSO algorithm to solve problem in machine scheduling ⋮ Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness ⋮ Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach ⋮ Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window ⋮ Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed ⋮ An efficient local search for minimizing completion time variance in permutation flow shops ⋮ Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem ⋮ A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs

Cites Work

• Unnamed Item
• Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
• On scheduling around large restrictive common due windows
• A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date
• Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
• An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
• A tabu search approach for the flow shop scheduling problem
• A heuristic algorithm for mean flowtime objective in flowshop scheduling
• A heuristic for single machine scheduling with early and tardy costs
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Benchmarks for basic scheduling problems
• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing mean absolute deviation of completion times about a common due date
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• A Review of Production Scheduling
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• The Complexity of Flowshop and Jobshop Scheduling
• Performance of decomposition procedures for job shop scheduling problems with bottleneck machines
• The Total Tardiness Problem: Review and Extensions
• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
• Local search heuristics for two-stage flow shop problems with secondary criterion

This page was built for publication: Permutation flow shop scheduling with earliness and tardiness penalties