Job lateness in a two-machine flowshop with setup times separated

DOI10.1016/0305-0548(91)90060-5zbMath0747.90046OpenAlexW2042596225MaRDI QIDQ1184446

Parthasarati Dileepan, Tapan Sen

Publication date: 28 June 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(91)90060-5

zbMATH Keywords

branch-and-bound algorithmheuristicsdue dateoptimality conditionmaximum job latenesstwo-machine flowshop problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (max. 100)

Scheduling a two-stage hybrid flowshop with separable setup and removal times ⋮ Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications ⋮ A bicriteria flowshop scheduling problem with setup times ⋮ Total flowtime in no-wait flowshops with separated setup times. ⋮ Some effective heuristics for no-wait flowshops with setup times to minimize total completion time ⋮ A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness ⋮ A new heuristic and dominance relations for no-wait flowshops with setups ⋮ Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness ⋮ A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application ⋮ A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times ⋮ Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm

Cites Work

• On two-machine scheduling with release and due dates to minimize maximum lateness
• Sequencing n Jobs on Two Machines with Arbitrary Time Lags
• Optimal two- and three-stage production schedules with setup times included
• Sequency on two and three machines with setup, processing and removal times separated
• On Johnson's Two-Machine Flow Shop with Random Processing Times
• Two-Stage, Hybrid Flowshop Scheduling Problem
• On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
• The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS
• A dual algorithm for the one-machine scheduling problem
• Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time
• Sequencing n jobs on two machines with setup, processing and removal times separated
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Job lateness in a two-machine flowshop with setup times separated