In this article, we consider single-manufacturer-single buyer supply chain problem in which the manufacturer procures raw material from outside supplier and distributes the preset amount of produced finished goods to the buyer at a fixed-time interval in multiple deliveries. An integrated model...

Well established conventional algorithms are available for solving the optimum power flow (OPF) problem. But the recent trend is to use the tools such as genetic algorithms (GAs) evolutionary programming technique, etc., because of some of their superior qualities. Simulated annealing (SA) is...

Supply chain management is an important management paradigm as it helps to develop mechanisms, align their objectives and coordinate their activities to optimise system performance. Enterprises today have realised the importance of supply chain management to achieve operational efficiency and...

This paper investigates the multistage hybrid flow shop (HFS) scheduling problems using the new bat algorithm. A HFS is the generalisation of flowshop with multiple machines. HFS is one of the important scheduling problems that represent many industries like iron and steel, chemical, textile and...

Generalised assignment problem (GAP) is a well-known non-deterministic polynomial (NP) hard combinatorial optimisation problem to find the minimum cost during assignment of jobs to agents so that each job is assigned exactly once and agents are not overloaded. In this research, we look at the...

Due to globalisation, the FMCG distributors in the developing countries are struggling to capture and retain their market share from the multinational companies. To attract the retailers, the distributors supply on credit and collect the amount in unequal weekly instalments. When the supply on...

The job shop problem is among the class of non-deterministic polynomial time hard combinatorial problems. This research article addresses the problem of static job shop scheduling on the job-based representation and the rule-based representations. The popular search techniques, such as the...

Generalised assignment problem (GAP) is a well-known non-deterministic polynomial (NP) hard combinatorial optimisation problem to find the minimum cost during assignment of jobs to agents so that each job is assigned exactly once and agents are not overloaded. In this research, we look at the...

Due to globalisation, the FMCG distributors in the developing countries are struggling to capture and retain their market share from the multinational companies. To attract the retailers, the distributors supply on credit and collect the amount in unequal weekly instalments. When the supply on...

Logistics is no longer seen as tactical and cost-driven – it is strategic. Considering the driver-on-time rules and with the perishable nature of the products, the travel length/time is one of the critical constraints in distribution logistics. We consider a typical logistics problem with...