Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration

DOI10.1016/j.apm.2008.01.013zbMath1168.90473OpenAlexW2036869053MaRDI QIDQ840154

Lixin Tang, Peng Liu

Publication date: 5 September 2009

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2008.01.013

zbMATH Keywords

transportationheuristicflowshop schedulingdeteriorationbatching machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (20)

Minimizing makespan in a two-machine flowshop scheduling with batching and release time ⋮ Single-machine scheduling with precedence constraints and position-dependent processing times ⋮ Single-machine scheduling problems with both deteriorating jobs and learning effects ⋮ A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size ⋮ Bicriteria Scheduling on a Single Batching Machine with Transportation and Deterioration to Minimize Total Completion Time and Production Costs ⋮ Realistic two-stage flowshop batch scheduling problems with transportation capacity and times ⋮ Single-machine scheduling with time-and-resource-dependent processing times ⋮ A two-stage flow shop scheduling problem with transportation considerations ⋮ New complexity results on scheduling problem in a robotic cell ⋮ Single-machine scheduling with nonlinear deterioration ⋮ A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints ⋮ A note on single-machine scheduling with decreasing time-dependent job processing times ⋮ Two-agent single-machine scheduling problems under increasing linear deterioration ⋮ Using genetic algorithms for the coordinated scheduling problem of a batching machine and two-stage transportation ⋮ Single machine scheduling with sum-of-logarithm-processing-times based deterioration ⋮ Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times ⋮ New results on the coordination of transportation and batching scheduling ⋮ Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times ⋮ Permutation Flow Shop Problem with Shortening Job Processing Times ⋮ MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS

Cites Work

• Unnamed Item
• Unnamed Item
• Machine scheduling with deliveries to multiple customer locations
• Efficient scheduling algorithms for a single batch processing machine
• Scheduling jobs under simple linear deterioration
• Complexity analysis of job-shop scheduling with deteriorating jobs
• A concise survey of scheduling with time-dependent processing times
• Complexity of flow shop scheduling problems with transportation constraints
• Scheduling with batching: A review
• Minimizing total tardiness in a scheduling problem with a learning effect
• Optimal two- and three-stage production schedules with setup times included
• Scheduling with time dependent processing times: Review and extensions
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Groups of Jobs on a Single Machine
• Machine scheduling with transportation considerations
• Makespan minimization for flow-shop problems with transportation times and a single robot
• Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed

This page was built for publication: Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration