We address the problem of scheduling jobs with non-identical sizes and distinct processing times on a single batch-processing machine, aiming at minimizing makespan. The extensive literature this NP-hard mostly focuses heuristics. Using an arc-flow based optimization approach, we construct novel formulation that represents it as determining flows in graphs. size increases machine capacity numbe...

This paper considers a single-machine scheduling problem with sequence-dependent setup times and energy-generation storage systems. Each job requires to be processed on the machine, both processing of require job-dependent amounts energy. The energy consumed by machine can bought from an Electric Power Company (EPC) or generated own Distributed Energy Resource (DER), such as solar photovoltaic ...

in this paper, the scheduling problem with nonresumable jobs and maintenance process is considered in order to minimize the makespan under two alternative strategies. the first strategy is to implement the maintenance process on the machine after a predetermined time period and the second one is to consider the maximum number of jobs that can be done with a special tool. we have proposed a new ...

This paper considers a fuzzy programming approach for a multi-objective single machine scheduling problem when processing times of jobs are normal random variables. The probabilistic problem is converted into an equivalent deterministic programming problem. Then the fuzzy programming technique has been applied to obtain a compromise solution. A numerical example demonstrates the feasibility of ...