OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES

DOI10.1142/S0217595914500286zbMath1302.90076OpenAlexW2077233523MaRDI QIDQ2931728

Myoung-Ju Park, Byung-Cheon Choi

Publication date: 26 November 2014

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595914500286

zbMATH Keywords

schedulingpermutation flow shopoutsourcingmachine-dependent processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Scheduling of two-machine flowshop with outsourcing lead-time ⋮ Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates

Cites Work

• Minimizing makespan in an ordered flow shop with machine-dependent processing times
• Two-machine flow shop scheduling problem with an outsourcing option
• Two parallel machine sequencing problems involving controllable job processing times
• Two-stage production scheduling with an outsourcing option
• Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed
• Competition and Outsourcing with Scale Economies
• Faster algorithms for the shortest path problem
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Flowshop sequencing problem with ordered processing time matrices: A general case
• The Complexity of Flowshop and Jobshop Scheduling
• Techniques for scheduling with rejection
• Multiprocessor Scheduling with Rejection

This page was built for publication: OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES