We consider m-machine permutation flow shop problems with an outsourcing option for a special case where each job's processing time equals the job's processing requirement plus a characteristic value of the machine. The objective is to minimize the sum of the performance measure for in-house...

We consider a continuous time–cost tradeoff problem with multiple milestones and completely ordered jobs. If a milestone is tardy, a penalty cost may be imposed. The processing times of jobs can be compressed by additional resources or activities that incur compression costs. The objective is...

We consider two linear project time–cost tradeoff problems with multiple milestones. Unless a milestone is completed on time, penalty costs for tardiness may be imposed. However, these penalty costs can be avoided by compressing the processing times of certain jobs that require additional...

This paper considers a two-machine ordered flow shop problem, where each job is processed through the in-house system or outsourced to a subcontractor. For in-house jobs, a schedule is constructed and its performance is measured by the makespan. Jobs processed by subcontractors require paying an...